Pathfinding Algorithms for A Level

Master Dijkstra’s and A* Algorithms for A Level Computer Science

Pathfinding is an essential topic in A Level Computer Science. From modelling road networks to intelligent search in games and software, teachers must confidently explain how algorithms like Dijkstra’s Shortest Path and the A* Search Algorithm work and how they map to assessment objectives. Our targeted 2-hour live online instructor led course gives you that expertise — with clear explanations, worked examples, classroom strategies, and ready-to-use teaching resources.

Who Should Attend

This course is designed for computing teachers delivering A Level Computer Science. You should have some foundational algorithm knowledge (e.g., GCSE search/sort).

If you want to understand, and teach pathfinding algorithms, then this course is for you.

What you will learn

Dijkstra’s Shortest Path Algorithm

• Understand the purpose of Dijkstra’s algorithm in the context of A Level specifications.

• Step-through the algorithm with worked examples on weighted graphs.

• Analyse how and why it finds the shortest path in a deterministic way.

• Relate pseudocode to real classroom activities and exam-style questions.

A* (A Star) Search Algorithm

• Learn how A* builds on Dijkstra’s approach by integrating a heuristic to guide search more efficiently.

• Interpret the total cost function and explore heuristic design strategies.

• Compare performance implications with traditional search methods.

• Apply the algorithm in practical contexts and lesson illustrations.

Online Course

This course is held as a two hour twilight course which is delivered online over Zoom.

During this two hour instructor led course you will be learning skills you can immediately take in to the classroom.

If you are viewing this page on a mobile, hold your phone horizontal to view the full table below which contains dates for our online course.

Course Tutor

The course is delivered by David Batty, a qualified teacher who has 35 years of classroom experience teaching computing, and who has been a programmer for 44 years. David delivers courses for the the NCCE, OCR, Code College and other organisations as required.

Booking or More Information

If you would like to book  training delivered in your school or if you would like more information on this or any of our other courses then you can either email courses@codecollege.co.uk or phone us on 01772 454328 (10am to 10pm – 7 days a week)

Outcomes

By the end of this course you will:

• Explain the theoretical underpinnings of pathfinding and shortest-path problems.

• Confidently teach Dijkstra’s algorithm with real examples and visualisations.

• Introduce A* search with clear heuristic reasoning and practical classroom models.

• Translate abstract algorithm steps into accessible lessons and exam practice tasks.