Ultimate A-Level Computer Science Podcast

A-Level Computer Science – Dijkstra’s, A & Travelling Salesman Explained | OCR A Level | S12:Ep6

April 16, 2026·17 min
Episode Description from the Publisher

This episode introduces optimization algorithms in computer science, specifically focusing on Dijkstra's shortest path algorithm and the A algorithm*. It explains how Dijkstra's algorithm finds the shortest path between a starting point and all other nodes in a weighted graph, with applications in areas like internet routing and GPS. The document then contrasts computable and incomputable problems, using the Travelling Salesman Problem (TSP) as an example of an intractable problem that is difficult to solve efficiently. Finally, it introduces heuristic methods as a practical approach for finding approximate solutions to intractable problems, and describes the A* algorithm as a path-finding algorithm that uses a heuristic function to focus on reaching a specific goal node.

Podzilla Summary coming soon

Sign up to get notified when the full AI-powered summary is ready.

Get Free Summaries →

Free forever for up to 3 podcasts. No credit card required.

Listen to This Episode

Get summaries like this every morning.

Free AI-powered recaps of Ultimate A-Level Computer Science Podcast and your other favorite podcasts, delivered to your inbox.

Get Free Summaries →

Free forever for up to 3 podcasts. No credit card required.