Algorithms - Optimisation (Dijkstra)
Authored by R Woodruff
Computers
12th Grade
Used 109+ times
AI Actions
Add similar questions
Adjust reading levels
Convert to real-world scenario
Translate activity
More...
Content View
Student View
22 questions
Show all answers
1.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
In a weighted graph what is an edge?
A node or dot.
A connecting line.
2.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
Can I run Dijkstra on a non-weighted graph?
Yes
No
3.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
Before looping through the nodes, what do we set as the values for the weights for all the nodes?
The weights on the edges
Set them all to infinity.
Set them all to infinity and the starting one to zero.
Set them all to infinity and leave the starting nodes' weight.
4.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
What algorithm does Google Maps use?
Dijkstra's
Distance-Vector
A*
D*
5.
FILL IN THE BLANKS QUESTION
1 min • 1 pt
Optimisation algorithms are designed to find the (a) path from a start node to any other node
6.
MULTIPLE SELECT QUESTION
45 sec • 1 pt
Select all correct applications of a shortest-path algorithm
Navigation
NPC control in gaming
Sending data packets
Financial investment choices
AI neural network training
7.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
Each node within a shortest path algorithm is ______
Weighted
Heavy
Valued
Numbered
Access all questions and much more by creating a free account
Create resources
Host any resource
Get auto-graded reports
Continue with Google
Continue with Email
Continue with Microsoft
or continue with
%20(1).png)
Apple
Others
By signing up, you agree to our Terms of Service & Privacy Policy
Already have an account?
