Two free sample worksheets on Dijkstra’s shortest path algorithm for AQA A
Level Computer Science (7517), with full answer keys, so you can see exactly
what the full pack contains before buying anything.

Each sheet is built on its own weighted network. Question 1 is the trace
table, one row per vertex settled, with tentative distances and the vertex
each one was reached from. Question 2 asks for the length of the shortest path
and for the path itself, read back off the completed table. Question 3 asks
why a settled distance never changes, and for an application.

These networks were generated so that the answer is never arguable: at every
step exactly one unvisited vertex has the smallest tentative distance, and the
shortest path to the target is unique. Whatever tie-breaking convention your
department teaches, the answer key agrees with it.

These two sheets are not in the paid pack - they are extra, so nothing is
wasted if you buy it afterwards.

The full pack contains 20 worksheets and 20 answer keys, every one built on a
different network, which is what makes it usable for a whole class, a resit
and a homework without any two students holding the same questions. Search ����Vlog
for “AQA A Level Computer Science Dijkstra shortest path” to find it.