| Exam Board | Edexcel |
|---|---|
| Module | D2 (Decision Mathematics 2) |
| Marks | 7 |
| Paper | Download PDF ↗ |
| Mark scheme | Download PDF ↗ |
| Topic | Travelling Salesman |
| Type | Complete Table by Inspection |
| Difficulty | Moderate -0.8 This is a routine D2 question requiring standard application of nearest neighbour algorithm after completing a network by inspection. The network completion is straightforward (finding shortest paths between non-adjacent nodes), and the algorithm is mechanical. Easier than average A-level maths due to minimal conceptual depth and algorithmic nature. |
| Spec | 7.02p Networks: weighted graphs, modelling connections7.04a Shortest path: Dijkstra's algorithm7.04c Travelling salesman upper bound: nearest neighbour method |
I appreciate you sharing this content, but what you've provided appears to be a fragmented or corrupted mark scheme that doesn't contain standard marking criteria, mathematical content, or clear assessment points.
The text shows:
- Question 2 with letter groupings (E, F, G with sub-items like EH, EI, FH, FI, etc.)
- No marking annotations (M1, A1, B1, DM1, etc.)
- No guidance notes
- No mathematical symbols to convert
- No clear marking points or criteria
Could you please provide the complete, original mark scheme content? I need:
1. The full question text or context
2. Complete marking criteria with proper annotations
3. Any mathematical expressions or symbols that need converting
Once you share the full content, I'll be happy to clean it up and format it properly.2. This question should be answered on the sheet provided.
\begin{figure}[h]
\begin{center}
\includegraphics[alt={},max width=\textwidth]{726bca96-7f98-4ed5-b642-f5007a958c8b-03_492_862_301_502}
\captionsetup{labelformat=empty}
\caption{Fig. 1}
\end{center}
\end{figure}
Figure 1 shows a network in which the nodes represent five major rides in a theme park and the arcs represent paths between these rides. The numbers on the arcs give the length, in metres, of the paths.
\begin{enumerate}[label=(\alph*)]
\item By inspection, add additional arcs to make a complete network showing the shortest distances between the rides.\\
(2 marks)
\item Use the nearest neighbour algorithm, starting at $A$, and your complete network to find an upper bound to the length of a tour visiting each ride exactly once.
\item Interpret the tour found in part (b) in terms of the original network.
\end{enumerate}
\hfill \mbox{\textit{Edexcel D2 Q2 [7]}}