Skip to main content

Pathfinding algorithms in A Level computer science

CP504 Live remote training course

During this course you'll explore how pathfinding algorithms can be used to find the shortest path between a set of points.

Skip to course booking
Programming Algorithms Post 16 Teach secondary computing certificate
Live remote training course 2 hours

  • Live remote training 24 April 09:00—24 April 2024
  • Live remote training 8 May 16:00—8 May 2024
  • Live remote training 29 May 16:00—29 May 2024
  • Live remote training 6 June 16:00—6 June 2024
  • Live remote training 20 June 16:00—20 June 2024
  • Live remote training 2 July 16:00—2 July 2024
  • Live remote training 22 July 16:00—22 July 2024
  • Live remote training 22 October 15:45—22 October 2024
  • Live remote training 11 November 15:45—18 November 2024

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 from GCSE computer science specifications.

During this course you’ll access the Isaac Computer Science platform, it is advised you sign up for a free, teachers account ahead of the course.

Topics 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 long is this course?

This course will last approximately 2 hours, these sessions maybe split across multiple days.

How will you learn?

Scheduled live, interactive online sessions led by an experienced practitioner. Flexible Professional Development Leader-supported, participant-led tasks, involving deep exploration of the subject content.

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

This course is part of Teach secondary computing

Teach secondary computing

Our nationally recognised qualification will give you confidence to take your computing teaching to the next level and to apply those skills in the classroom.

Find out more

A level Computer Science subject knowledge

Find out more

Book this course

You need to be logged in to start the course.

Login to book this course

Create STEM Learning account

This course is from the National Centre for Computing Education and is delivered by STEM Learning.

Adapted teaching and effective learning interventions in secondary computing

Develop an evidence-informed approach to education recovery over a sustained period, securing the computing education of young people following a period of great disruption.

Live remote training course

Adapting the Teach Computing Curriculum for mixed-year classes - short course

Explore progression within Teach Computing Curriculum and how to use this to adapt it for your own mixed-age setting.

Live remote training course

AI in primary computing

Explore how Artificial Intelligence (AI) may be linked to aspects of the primary computing curriculum, supporting creativity, digital literacy, and the use of information technology.

Live remote training course