OCR D1 2005 January — Question 4 12 marks

Exam BoardOCR
ModuleD1 (Decision Mathematics 1)
Year2005
SessionJanuary
Marks12
PaperDownload PDF ↗
Mark schemeDownload PDF ↗
TopicMinimum Spanning Trees
TypeApply Prim's algorithm in matrix form
DifficultyModerate -0.3 This is a standard D1 MST question requiring routine application of Prim's algorithm in matrix form (a core syllabus skill), followed by straightforward logical deductions about Hamiltonian paths. The algorithm application is mechanical, and parts (iii)-(v) require only basic graph reasoning about necessary/forbidden edges when visiting vertices exactly once. Slightly easier than average due to the small graph size (8 vertices) and structured guidance through each part.
Spec7.02a Graphs: vertices (nodes) and arcs (edges)7.02p Networks: weighted graphs, modelling connections7.04b Minimum spanning tree: Prim's and Kruskal's algorithms7.04c Travelling salesman upper bound: nearest neighbour method

4 [Answer this question on the insert provided.]
A competition challenges teams to hike across a moor, visiting each of eight peaks, in the quickest possible time. The teams all start at peak \(A\) and finish at peak \(H\), but other than this the peaks may be visited in any order. The estimated journey times, in hours, between peaks are shown in the table. A dash in the table means that there is no direct route between two peaks.
\(A\)\(B\)CD\(E\)\(F\)G\(H\)
A-423----
\(B\)4-1-3---
C21-2-65-
\(D\)3-2---4-
\(E\)-3---8-7
\(F\)--6-8--8
\(G\)--54---9
\(H\)----789-
  1. Use Prim's algorithm on the table in the insert to find a minimum spanning tree. Start by crossing out row \(A\). Show which entries in the table are chosen and indicate the order in which the rows are deleted. What can you deduce from this answer about the quickest possible time needed to complete the challenge?
  2. On the insert, draw a network to represent the information given in the table above. A team decides to visit each peak exactly once on the hike from peak \(A\) to peak \(H\).
  3. Explain why the team cannot use the arc \(A C\).
  4. Explain why the team must use the arc \(E F\).
  5. There are only two possible routes that the team can use. Find both routes and determine which is the quicker route.

Question 4:
Part (i)
AnswerMarks Guidance
AnswerMark Guidance
Starting by choosing row \(C\) in column \(A\)M1 For starting by choosing row \(C\) in column \(A\)
Choosing more than one entry from column \(C\)M1 For choosing more than one entry from column \(C\)
Correct order \((A)\), \(C\), \(B\), \(D\), \(E\), \(G\), \(F\), \(H\)A1 For a correct order
Correct entries chosen or a correct tree drawnB1 For correct entries chosen or a correct tree drawn
Quickest time is at least 25 hoursB1 For 25; accept 'more than 25'
Part (ii)
AnswerMarks Guidance
AnswerMark Guidance
Correct graph drawnM1 For a correct graph drawn
Correct weights shownA1 For correct weights shown
Part (iii)
AnswerMarks Guidance
AnswerMark Guidance
If \(AC\) is used then either \(B\) or \(D\) is excluded. Or must pass through \(C\) in getting between \(B\) and \(D\), so \(AC\) is impossibleB1 For explaining what happens if \(AC\) is used or why \(AC\) cannot be included. Follow through graph if possible, provided same conclusion is valid
Part (iv)
AnswerMarks Guidance
AnswerMark Guidance
If \(EF\) is not used then passing through either \(E\) or \(F\) will take the team to \(H\); the team will not be able to visit both \(E\) and \(F\)B1 For stating the effect of not using arc \(EF\) or for considering all possible routes into \(H\). Follow through graph if possible, provided same conclusion is valid
Part (v)
AnswerMarks Guidance
AnswerMark Guidance
\(ABEFCDGH\)M1 For this route
\(ADGCBEFH\)M1 For this route
The second route is quicker (32 hours compared with 36 hours)A1 For identifying \(ADGCBEFH\) as the quicker or for calculating 32. Follow through graph if possible
# Question 4:

## Part (i)
| Answer | Mark | Guidance |
|--------|------|----------|
| Starting by choosing row $C$ in column $A$ | M1 | For starting by choosing row $C$ in column $A$ |
| Choosing more than one entry from column $C$ | M1 | For choosing more than one entry from column $C$ |
| Correct order $(A)$, $C$, $B$, $D$, $E$, $G$, $F$, $H$ | A1 | For a correct order |
| Correct entries chosen or a correct tree drawn | B1 | For correct entries chosen or a correct tree drawn |
| Quickest time is at least 25 hours | B1 | For 25; accept 'more than 25' |

## Part (ii)
| Answer | Mark | Guidance |
|--------|------|----------|
| Correct graph drawn | M1 | For a correct graph drawn |
| Correct weights shown | A1 | For correct weights shown |

## Part (iii)
| Answer | Mark | Guidance |
|--------|------|----------|
| If $AC$ is used then either $B$ or $D$ is excluded. Or must pass through $C$ in getting between $B$ and $D$, so $AC$ is impossible | B1 | For explaining what happens if $AC$ is used or why $AC$ cannot be included. Follow through graph if possible, provided same conclusion is valid |

## Part (iv)
| Answer | Mark | Guidance |
|--------|------|----------|
| If $EF$ is not used then passing through either $E$ or $F$ will take the team to $H$; the team will not be able to visit both $E$ and $F$ | B1 | For stating the effect of not using arc $EF$ or for considering all possible routes into $H$. Follow through graph if possible, provided same conclusion is valid |

## Part (v)
| Answer | Mark | Guidance |
|--------|------|----------|
| $ABEFCDGH$ | M1 | For this route |
| $ADGCBEFH$ | M1 | For this route |
| The second route is quicker (32 hours compared with 36 hours) | A1 | For identifying $ADGCBEFH$ as the quicker or for calculating 32. Follow through graph if possible |

---
4 [Answer this question on the insert provided.]\\
A competition challenges teams to hike across a moor, visiting each of eight peaks, in the quickest possible time. The teams all start at peak $A$ and finish at peak $H$, but other than this the peaks may be visited in any order. The estimated journey times, in hours, between peaks are shown in the table. A dash in the table means that there is no direct route between two peaks.

\begin{center}
\begin{tabular}{|l|l|l|l|l|l|l|l|l|}
\hline
 & $A$ & $B$ & C & D & $E$ & $F$ & G & $H$ \\
\hline
A & - & 4 & 2 & 3 & - & - & - & - \\
\hline
$B$ & 4 & - & 1 & - & 3 & - & - & - \\
\hline
C & 2 & 1 & - & 2 & - & 6 & 5 & - \\
\hline
$D$ & 3 & - & 2 & - & - & - & 4 & - \\
\hline
$E$ & - & 3 & - & - & - & 8 & - & 7 \\
\hline
$F$ & - & - & 6 & - & 8 & - & - & 8 \\
\hline
$G$ & - & - & 5 & 4 & - & - & - & 9 \\
\hline
$H$ & - & - & - & - & 7 & 8 & 9 & - \\
\hline
\end{tabular}
\end{center}

(i) Use Prim's algorithm on the table in the insert to find a minimum spanning tree. Start by crossing out row $A$. Show which entries in the table are chosen and indicate the order in which the rows are deleted. What can you deduce from this answer about the quickest possible time needed to complete the challenge?\\
(ii) On the insert, draw a network to represent the information given in the table above.

A team decides to visit each peak exactly once on the hike from peak $A$ to peak $H$.\\
(iii) Explain why the team cannot use the arc $A C$.\\
(iv) Explain why the team must use the arc $E F$.\\
(v) There are only two possible routes that the team can use. Find both routes and determine which is the quicker route.

\hfill \mbox{\textit{OCR D1 2005 Q4 [12]}}