Cambridge A Level Computer Science 9618 – P3.30 Graphs and Dijkstra's algorithm – Lesson & Worksheet

Bespoke, fully editable lesson for Cambridge International AS & A Level Computer Science (9618): P3.30 Graphs and Dijkstra’s algorithm. Slides, worksheet and full answers.

Written for Paper 3 Advanced Theory, section 18 Artificial intelligence (syllabus 18.1.1). Everything is editable, so you can adapt it to your class.

What’s included

• PowerPoint lesson (13 slides) with teacher notes on every slide
• Student worksheet (Word), ready to print or edit
• Answer sheet (Word) with mark-scheme style answers for every question

P3.30 Graphs and Dijkstra’s algorithm

By the end of the lesson students can:

• Describe the purpose and structure of a graph and how graphs help AI
• Use Dijkstra’s algorithm by hand to find the shortest path in a weighted graph
• Record the order nodes are visited and read the shortest route back

Worksheet sections: A. Key words; B. Run Dijkstra’s algorithm; C. Read the route back; D. Exam-style questions; E. Challenge

Every lesson includes

• Learning goals and a starter question
• Clear explanations, diagrams and worked examples (Cambridge pseudocode, as in the 2027–2029 pseudocode guide, with Python alongside)
• A quick check and a “your turn” task linked to the worksheet
• Exam-style questions with marks, and an exit ticket

Format

• PowerPoint (.pptx) and Word (.docx), fully editable
• Works in PowerPoint and Google Slides
• Calm, muted sixth-form design, consistent across the whole course

These are independent resources written for the Cambridge International AS & A Level Computer Science syllabus (9618) for examination in 2027, 2028 and 2029. They are not produced or endorsed by Cambridge University Press & Assessment. Syllabus point numbers are our own numbering of the syllabus statements.