Edexcel D1 2001 June — Question 3 7 marks

Exam BoardEdexcel
ModuleD1 (Decision Mathematics 1)
Year2001
SessionJune
Marks7
PaperDownload PDF ↗
Mark schemeDownload PDF ↗
TopicRoute Inspection
TypeWrite explicit optimal route
DifficultyStandard +0.3 This is a straightforward application of the Chinese Postman algorithm with a small network. Students need to identify odd-degree vertices, find minimum pairings, and write out a route—all standard D1 procedures requiring methodical execution rather than insight. The network is small enough to manage easily, making this slightly easier than average.
Spec7.04e Route inspection: Chinese postman, pairing odd nodes
3. \begin{figure}[h]
\captionsetup{labelformat=empty} \caption{Figure 2} \includegraphics[alt={},max width=\textwidth]{6d306129-6e1f-424a-b21c-1bf6434ee082-4_678_1151_425_399}
\end{figure} Figure 2 shows a new small business park. The vertices \(A , B , C , D , E , F\) and \(G\) represent the various buildings and the arcs represent footpaths. The number on an arc gives the length, in metres, of the path. The management wishes to inspect each path to make sure it is fit for use. Starting and finishing at \(A\), solve the Route Inspection (Chinese Postman) problem for the network shown in Fig. 2 and hence determine the minimum distance thet needs to be walked in carrying out this inspection. Make your method and working clear and give a possible route of minimum length.
3.

\begin{figure}[h]
\begin{center}
\captionsetup{labelformat=empty}
\caption{Figure 2}
  \includegraphics[alt={},max width=\textwidth]{6d306129-6e1f-424a-b21c-1bf6434ee082-4_678_1151_425_399}
\end{center}
\end{figure}

Figure 2 shows a new small business park. The vertices $A , B , C , D , E , F$ and $G$ represent the various buildings and the arcs represent footpaths. The number on an arc gives the length, in metres, of the path. The management wishes to inspect each path to make sure it is fit for use.

Starting and finishing at $A$, solve the Route Inspection (Chinese Postman) problem for the network shown in Fig. 2 and hence determine the minimum distance thet needs to be walked in carrying out this inspection. Make your method and working clear and give a possible route of minimum length.\\

\hfill \mbox{\textit{Edexcel D1 2001 Q3 [7]}}
This paper (7 questions)
View full paper
Q1 5 Q2 7 Q3 7 Q4 11 Q5 12 Q6 16 Q7 17