Pathfinding algorithms in A Level computer science CH504 / F01

Start date
12 Mar 24
Duration
2 Hours
Learning Method
Remote Delivered CPD

This course still has availability, book now

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 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.

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?

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.

How long is this course?

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

Who is the course leader?

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

Sessions

DateTimeLocation
1 - Dijkstra’s Shortest Path Algorithm12 March 202416:00-17:00Virtual
2 - A* Search Algorithm12 March 202417:00-18:00Virtual

Share with your CPD booker

Cost

Trainee TeacherActivity feeFree
Priority schoolActivity feeFreeSubsidy available*£0.00
Priority school repeat teacherActivity feeFreeSubsidy available*£0.00
English MaintainedActivity feeFreeSubsidy available*£0.00
OtherActivity fee£75.00 +VATSubsidy available*£0.00

This subsidy can contribute towards the costs associated with supply cover Find out more.

Participants from outside the UK will be charged the course fee and an additional £120 per day plus VAT.

Outside the UK? Fee information

Check your school subsidy status

The subsidy value may be higher for your school or college.

This course still has availability, book now

Additional information

For courses at the National STEM Learning Centre in York, fees include meals and accommodation for the duration of the course. 

 

Interested in this course?

Sign up to receive our emails to hear about the latest CPD available