Pathfinding algorithms in A Level computer science CO504
During this course you'll explore how pathfinding algorithms can be used to find the shortest path between a set of points.
Summary
Pathfinding algorithms are used to find solutions to a given problem, using the shortest path between a set of points. These problems are commonplace, from satellite navigation systems to internet packet routing. During this course you’ll learn how the Dijkstra’s and A* search algorithms function.
You’ll explore how pathfinding algorithms are mapped to the A Level computer science curriculum, including the opportunity to discuss strategies of how to teach both algorithms effectively.
Who is it for?
This course is aimed at teachers delivering A Level computer science. It is advised you have some basic knowledge of algorithms form GCSE computer science specifications.
What topics are covered?
- Dijkstra’s Shortest Path Algorithm – during this session you’ll explore how the Dijkstra’s algorithm functions, including with examples and opportunities for you to put the algorithm in practice.
- A* Search Algorithm – during this session you’ll explore how the A* search algorithm works, you’ll have the opportunity to practice using examples and explore the pseudocode behind the algorithm.
How will you learn?
This online, self-paced course can be completed flexibly. You can join and start this course at any time after the advertised date, and keep access for a year after booking.
How long is this course?
This course is approximately 2 hours of self directed learning.
Outcomes
By the end of this intensive CPD pathway you will be able to:
- Understand the purpose of pathfinding algorithms
- Explore the Dijkstra’s algorithm, examine how the algorithm functions
- Explore the A* search algorithm, examine how the algorithm functions
- Practice finding the shortest path, using both pathfinding algorithms