7137234
Description
Quiz by Mena Sargios, updated more than 1 year ago
|
Created by Mena Sargios
over 7 years ago
|
|
Question 1
Question
What is the purpose of Dijkstra's algorithm (what problem does it solve)?
Answer
-
Dijkstra's finds the shortest path from an initial vertex to all of the other vertices.
-
none of the above
Question 2
Question
A common algorithm for finding the shortest path on a graph is ___.
Answer
-
A) Huffman's
-
B) Euler's
-
C) Djikstra's
-
D) Hamiltonian's
Question 3
Question
What is used to find the shortest path in a graph?
Answer
-
Dijkstra's Algorithm
-
none of the above
Question 4
Question
How would you go about find the shortage path?
Answer
-
A.use the path that is not being used
-
B.you add up the path weights between the two points and which ever is smallest
-
C.find the longest path between to points
-
D.none of the above
Question 5
Question
Dijkstra's algorithm finds what kind of path between all vertices?
Answer
-
A. Longest Path
-
B. Shortest Path.
-
C. Tallest Path
-
D. None of the above
Question 6
Question
Which algorithim finds the shortest path between vertex 0 and all other verticies?
Answer
-
A) Primm's Algotrithim
-
B) Yoo's Algorithim
-
C) Fermi Algorithim
-
D) Dijkstra's Algorithim
Question 7
Question
What is used to find the shortest path of one node to all other nodes?
Answer
-
Djikstra's Algorithm
-
none
Question 8
Question
What aglorithm is used to find the shorest path between two nodes in a graph?
Answer
-
A. Depth First Search
-
B. Bubble Sort
-
C. Dijkstra's Algorithm
-
D. Prim's Algorithm
Question 9
Question
Dijkstra's algorithm finds the shortest path between a vertex and:
Answer
-
A. only one other node
-
B. two other nodes
-
C. all other nodes
-
D. n/a: Dijkstra's algorithm finds the smallest spanning tree.
Question 10
Question
What does Dijkstra's algorithm do?
Answer
-
A. it finds the longest path between vertex 0 and all other vertices
-
B. it finds the shortest path between vertex v and all other vertices
-
C. it finds the longest path between vertex v and all other vertices
-
D. it finds the shortest path between vertex 0 and all other vertices
Question 11
Question
When trying to find the shortest path and you have negative edges in the graph. You can still use Dijkstra’s algorithm?
Answer
- True
- False
Question 12
Question
Is the definition of Dijkstra's algorithm true or false?
Find the shortest path between vertex 0 and all other vertices
Answer
- True
- False
Question 13
Question
What are the two data structures that Dijkstra's Algorithm uses?
Answer
-
A) Two arrays
-
B) Two sets
-
C) A tree and a set
-
D) A set and an array
Want to create your own Quizzes for free with GoConqr? Learn more.