Computer Science (AS & A Level) · Oct / Nov 2023 · Paper 32 · Question 8
9618
As printed in the paper
The question as text
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. A B C F D E Start 8 4 8 9 2 2 10 3 7 Working Answers: A B C D E F [5]
Read automatically from the paper; the printed page above is exact.
Show the answer and mark scheme
Make a free account to save your answers and see your weak topics and ask the AI why a wrong answer is wrong.