A-LevelComputer ScienceAlgorithm design and problem-solving9618/32 · Oct/Nov 2023 · Q85 Marks
Calculate the shortest distance between the Start and each of the destinations in the diagram using Dijkstra's algorithm. Show your working and write your answers in the table provided. [Figure X.X]
- Calculate the shortest distance between the Start and each of the destinations in the diagram using Dijkstra's algorithm. Show your working and write your answers in the table provided. [Figure X.X] Working Answers: A B C D E F[5]
This question uses a diagram from the original paper, which isn't shown here. Open the full paper from the past papers archive to see it.
Mark scheme
Marking points from the official mark scheme (Oct/Nov 2023). The mark or mark type is shown in brackets.
- [1] Initialisation - setting Start to 0
- [1] ...and the rest of the towns to ∞
- [1] Evidence to show values at nodes being updated
- [1] Evidence to show 'visited node(s)'
- [1] Evidence to show a correct calculation of at least one route
- [1] Evidence to show more than one route has been calculated for at least one town
- [2] Two marks for all six correct values
- [1] One mark for four or five correct values.
Write your answer and get it marked
On Oracle Prep you can write or photograph your own answer and have it marked by AI against this mark scheme, with feedback on what you missed.
Sign up free →