Optimal Paths (Leaving Cert Applied Maths): Quizzes
📚Quizzes
Practise the questions
12 questions from this quiz
ShowHide
Practise the questions
12 questions from this quiz
What does Dijkstra's Algorithm find in a weighted graph?
What does Dijkstra's Algorithm find in a weighted graph?
The shortest path between nodes
Which is NOT a meaning of 'shortest' in Dijkstra's Algorithm context?
Which is NOT a meaning of 'shortest' in Dijkstra's Algorithm context?
Most nodes visited
Which real-world system uses Dijkstra's Algorithm?
Which real-world system uses Dijkstra's Algorithm?
GPS navigation systems
What values are assigned to the starting node?
What values are assigned to the starting node?
Order 1, final value 0
What is the key rule for selecting the next node?
What is the key rule for selecting the next node?
Choose node with smallest working value
Which is NOT a component of the tracking table?
Which is NOT a component of the tracking table?
Edge thickness
When are working values updated?
When are working values updated?
For nodes directly connected to new node
In the example, why is W chosen as the second completed node?
In the example, why is W chosen as the second completed node?
It has the smallest working value (7)
In the example, what is T's working value after W is completed?
In the example, what is T's working value after W is completed?
10
When U is completed, why does X keep value 15 not 16?
When U is completed, why does X keep value 15 not 16?
15 is smaller than 16
What is the shortest distance from S to Z in the worked example?
What is the shortest distance from S to Z in the worked example?
28
How do you trace the actual shortest path?
How do you trace the actual shortest path?
Work backwards from destination