Dijkstra’s Shortest Path Algorithm (AQA A-Level Computer Science): Quizzes
📚Quizzes
Practise the questions
10 questions from this quiz
ShowHide
Practise the questions
10 questions from this quiz
Who developed Dijkstra's algorithm and in what year?
Who developed Dijkstra's algorithm and in what year?
Edsger Dijkstra in 1959
What does Dijkstra's algorithm calculate from the starting point?
What does Dijkstra's algorithm calculate from the starting point?
Shortest path to every other point
What are the two main components that make up a graph?
What are the two main components that make up a graph?
Vertices and edges
What is a critical limitation of Dijkstra's algorithm regarding edge weights?
What is a critical limitation of Dijkstra's algorithm regarding edge weights?
Only works with positive weights
Which unvisited vertex should you move to next during the algorithm?
Which unvisited vertex should you move to next during the algorithm?
One with smallest known distance
Which TCP/IP routing protocol uses Dijkstra's algorithm?
Which TCP/IP routing protocol uses Dijkstra's algorithm?
OSPF
In manual tracing, what do subscript letters indicate?
In manual tracing, what do subscript letters indicate?
Which vertex you travelled from
What happens to a vertex's distance value once it is marked as fixed/locked?
What happens to a vertex's distance value once it is marked as fixed/locked?
It never changes
What data structure is most efficient for representing a weighted graph in code?
What data structure is most efficient for representing a weighted graph in code?
Two-dimensional array
Which problem is Dijkstra's algorithm NOT suitable for solving?
Which problem is Dijkstra's algorithm NOT suitable for solving?
Travelling salesman problem