
Dijkstra’s algorithm and A* lesson for Pearson Edexcel International A Level Computer Science, with editable PowerPoint slides, a student worksheet and full answers. Dijkstra’s algorithm finds the shortest path in a weighted graph, and A* adds a heuristic to search faster; students trace both.
Written for Unit 3 Advanced Principles of Computer Science, topic 15 Problem solving (specification 15.2.3). Everything is editable, so you can adapt it to your class.
What’s included- PowerPoint lesson (16 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
By the end of the lesson students can:
- Hand trace Dijkstra’s algorithm on a weighted graph and read off the shortest path
- Explain how A* uses f = g + h and an admissible heuristic to reach a target sooner
- Compare Dijkstra’s algorithm with A*
Worksheet sections: A. Recall; B. Trace Dijkstra’s algorithm; C. A* on the same graph; D. Exam-style questions; E. Challenge
Every lesson includes- Learning goals and a starter question
- Clear explanations, diagrams and worked examples (Python 3 throughout, as the specification requires)
- A quick check and a “your turn” task linked to the worksheet
- Exam-style questions with marks, and an exit ticket
- 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 Pearson Edexcel International Advanced Level Computer Science specification (Issue 1, first teaching 2026; IAS XCP01, IAL YCP01). They are not produced or endorsed by Pearson.
More lessons in this series- Previous lesson: Merge sort and quick sort – Edexcel IAL Computer Science lesson
- Next lesson: Big O notation – Edexcel IAL Computer Science lesson
- Save with the bundle: Problem solving – Edexcel IAL Computer Science (6 lessons)
Last updated: November 2026.
Something went wrong, please try again later.
This resource hasn't been reviewed yet
To ensure quality for our reviews, only customers who have purchased this resource can review it
Report this resourceto let us know if it violates our terms and conditions.
Our customer service team will review your report and will be in touch.