Edexcel D2 — Question 7 17 marks

Exam BoardEdexcel
ModuleD2 (Decision Mathematics 2)
Marks17
PaperDownload PDF ↗
Mark schemeDownload PDF ↗
TopicTravelling Salesman
TypeNearest Neighbour Algorithm
DifficultyModerate -0.5 This is a straightforward application of the nearest neighbour algorithm, a standard D2 procedure. Students follow a mechanical algorithm with clear rules, requiring minimal problem-solving or insight—just careful execution and arithmetic. While it involves multiple steps, it's more routine than an average A-level question since it's purely algorithmic rather than requiring mathematical reasoning.
Spec7.04a Shortest path: Dijkstra's algorithm7.04b Minimum spanning tree: Prim's and Kruskal's algorithms7.04c Travelling salesman upper bound: nearest neighbour method

7. This question should be answered on the sheet provided. A tinned food producer delivers goods to six supermarket warehouses, \(B , C , D , E , F\) and \(G\), from its base, \(A\). The distances, in kilometres, between each location are given in the table below. \section*{Please hand this sheet in for marking}

Question 7:
Part (a)
AnswerMarks Guidance
AnswerMarks Guidance
Prim's or Kruskal's applied correctlyM1
Edges selected: \(BE=32, BC=48, CD=41, AD=57, AG=52, DF\) or similar MSTA1A1
MST drawn correctlyA1
Upper bound \(= 2 \times \text{MST length}\)M1
Correct upper bound statedA1
Part (b)
AnswerMarks Guidance
AnswerMarks Guidance
Two shortcuts identified and appliedM1A1
Upper bound less than 375 km statedA1
Part (c)
AnswerMarks Guidance
AnswerMarks Guidance
Delete \(G\) and find MST on remaining nodesM1
Add two shortest edges from \(G\)M1
Lower bound calculated correctlyA1
Part (d)
AnswerMarks Guidance
AnswerMarks Guidance
Delete \(B\) and find MST on remaining nodesM1A1
Add two shortest edges from \(B\)M1
Lower bound calculated correctlyA1
Part (e)
AnswerMarks Guidance
AnswerMarks Guidance
State which is better (larger) lower bound with reasonB1
I can see these are answer sheets for students (not a mark scheme), showing question structures for what appears to be a Decision Mathematics paper (D2). The sheets show:
- Question 1: A network graph with nodes A, B, C, D, E and weighted edges (values 5, 7, 8, 9, 10, 11, 12, 13)
- Question 3: A dynamic programming table with Stages 1-4, States and Actions
- Question 7: A distance matrix for nodes A-G with various distances
These appear to be blank answer sheets provided to students - they do not contain mark scheme information, worked solutions, or mark allocations.
To extract mark scheme content as requested, I would need the actual mark scheme document, which would typically be a separate document showing:
- Model answers
- Mark allocations (M1, A1, B1, etc.)
- Examiner guidance notes
Could you share the actual mark scheme document? These student answer sheets don't contain the marking information you're looking for.
# Question 7:

## Part (a)
| Answer | Marks | Guidance |
|--------|-------|----------|
| Prim's or Kruskal's applied correctly | M1 | |
| Edges selected: $BE=32, BC=48, CD=41, AD=57, AG=52, DF$ or similar MST | A1A1 | |
| MST drawn correctly | A1 | |
| Upper bound $= 2 \times \text{MST length}$ | M1 | |
| Correct upper bound stated | A1 | |

## Part (b)
| Answer | Marks | Guidance |
|--------|-------|----------|
| Two shortcuts identified and applied | M1A1 | |
| Upper bound less than 375 km stated | A1 | |

## Part (c)
| Answer | Marks | Guidance |
|--------|-------|----------|
| Delete $G$ and find MST on remaining nodes | M1 | |
| Add two shortest edges from $G$ | M1 | |
| Lower bound calculated correctly | A1 | |

## Part (d)
| Answer | Marks | Guidance |
|--------|-------|----------|
| Delete $B$ and find MST on remaining nodes | M1A1 | |
| Add two shortest edges from $B$ | M1 | |
| Lower bound calculated correctly | A1 | |

## Part (e)
| Answer | Marks | Guidance |
|--------|-------|----------|
| State which is better (larger) lower bound with reason | B1 | |

I can see these are answer sheets for students (not a mark scheme), showing question structures for what appears to be a Decision Mathematics paper (D2). The sheets show:

- **Question 1**: A network graph with nodes A, B, C, D, E and weighted edges (values 5, 7, 8, 9, 10, 11, 12, 13)
- **Question 3**: A dynamic programming table with Stages 1-4, States and Actions
- **Question 7**: A distance matrix for nodes A-G with various distances

These appear to be **blank answer sheets** provided to students - they do not contain mark scheme information, worked solutions, or mark allocations.

To extract mark scheme content as requested, I would need the actual **mark scheme document**, which would typically be a separate document showing:
- Model answers
- Mark allocations (M1, A1, B1, etc.)
- Examiner guidance notes

Could you share the actual mark scheme document? These student answer sheets don't contain the marking information you're looking for.
7. This question should be answered on the sheet provided.

A tinned food producer delivers goods to six supermarket warehouses, $B , C , D , E , F$ and $G$, from its base, $A$. The distances, in kilometres, between each location are given in the table below.

\section*{Please hand this sheet in for marking}
(a)

(e)

\hfill \mbox{\textit{Edexcel D2  Q7 [17]}}