| Exam Board | Edexcel |
|---|---|
| Module | D2 (Decision Mathematics 2) |
| Marks | 10 |
| Paper | Download PDF ↗ |
| Mark scheme | Download PDF ↗ |
| Topic | Dynamic Programming |
| Type | Dynamic programming minimax route |
| Difficulty | Standard +0.3 This is a straightforward application of the minimax algorithm in dynamic programming, a standard D2 topic. Students follow a mechanical procedure working backwards through stages, comparing maximum distances at each node. While it requires careful bookkeeping across multiple stages, it involves no novel insight—just systematic application of a taught algorithm to a clearly structured network problem. |
| Spec | 7.05a Critical path analysis: activity on arc networks7.05b Forward and backward pass: earliest/latest times, critical activities |
I don't see any marking scheme content in the text you've provided. What you've shared appears to be a distance matrix table showing distances between UK cities (Leeds, Liverpool, Manchester, Newcastle, Nottingham, Oxford, and York), but it contains no marking annotations (M1, A1, B1, DM1, etc.) or marking guidance.
Could you please provide the actual mark scheme content that needs to be cleaned up?4. This question should be answered on the sheet provided.
The owner of a small plane is planning a journey from her local airport, $A$ to the airport nearest her parents, $K$. On the journey she will make three refuelling stops, the first at $B , C$ or $D$, the second at $E , F$ or $G$ and the third at $H , I$ or $J$.
\begin{figure}[h]
\begin{center}
\includegraphics[alt={},max width=\textwidth]{726bca96-7f98-4ed5-b642-f5007a958c8b-05_727_1303_523_356}
\captionsetup{labelformat=empty}
\caption{Fig. 2}
\end{center}
\end{figure}
Figure 2 shows all the possible flights that can be made on the journey with the number by each arc indicating the distance of each flight in hundreds of miles. As her plane does not have a large fuel tank, the owner wishes to choose a route that minimises the maximum distance of any one flight.
Find the route that she should use and state the maximum distance of any one stage on this route.\\
\hfill \mbox{\textit{Edexcel D2 Q4 [10]}}