Mark scheme (whole question; this part is marked with the orange bar)

Examiner's comment
This question was the most successfully attempted question on the paper. Application of Dijkstra’s algorithm in (a) is familiar fare and most students made reasonable attempts. There were a number of common errors including: Missing out the labelling of node D. Order of labelling errors with two or more nodes having the same label. The working values were sometimes incorrect with a ‘55’ instead of a ‘45’ at H. A number of errors in the order of the working values, for example, at node G and sometimes extra working values appeared, for example, a value of 35 at C. A few responses contained no working values. Overall students appeared to find it more challenging than might have been the case for a similar question in recent sessions for the legacy module 6689/01. Often students neglected to state the shortest time and/or the quickest route. Part (b) was generally well attempted. A significant proportion
Key points from the mark scheme and examiner's report
- 39 minutes, route AIFGH
- working values must be in the correct order with no extra values
- D often left unlabelled
- many forgot to state the time and/or the route


