| Exam Board | Edexcel |
|---|---|
| Module | D2 (Decision Mathematics 2) |
| Marks | 6 |
| Paper | Download PDF ↗ |
| Mark scheme | Download PDF ↗ |
| Topic | Travelling Salesman |
| Type | Nearest Neighbour Algorithm |
| Difficulty | Moderate -0.8 This is a straightforward application of the nearest neighbour algorithm to a small network with 5 nodes. It requires only mechanical execution of a standard algorithm with no problem-solving or insight needed, making it easier than average but not trivial since students must carefully track visited nodes and sum distances correctly. |
| Spec | 7.04c Travelling salesman upper bound: nearest neighbour method |
| Answer | Marks | Guidance |
|---|---|---|
| 1 | G | GI |
| H | HI |
I appreciate you sharing this, but the content you've provided appears to be incomplete or corrupted. It shows:
```
Question 1:
1 | G | GI
H | HI
```
This doesn't contain enough information for me to clean up as a mark scheme. Mark schemes typically include:
- Mark allocation codes (M1, A1, B1, etc.)
- Correct answers or working
- Guidance notes
- Mathematical notation
Could you please provide the complete mark scheme content? Once you share the full text, I'll be happy to:
1. Convert Unicode symbols to LaTeX notation
2. Preserve marking annotations
3. Format it clearly with one point per line1.
\begin{figure}[h]
\begin{center}
\includegraphics[alt={},max width=\textwidth]{4e50371b-0c1c-4b4e-b21d-60858ae160df-2_659_986_203_479}
\captionsetup{labelformat=empty}
\caption{Fig. 1}
\end{center}
\end{figure}
The network in Figure 1 shows the shortest distance by road, in kilometres, between five villages.
Find the best achievable upper bound for a tour of the network, of minimum length, using the nearest neighbour algorithm.\\
\hfill \mbox{\textit{Edexcel D2 Q1 [6]}}