Quiz
14. Graph Shrtest Path
Create a free account to finish this quiz
Save your progress and see your final score.
Already have an account? Sign in
Questions in this quiz (13)
1What is the purpose of Dijkstra's algorithm (what problem does it solve)?
- ADijkstra's finds the shortest path from an initial vertex to all of the other vertices.
- Bnone of the above
2A common algorithm for finding the shortest path on a graph is ___.
- AA) Huffman's
- BB) Euler's
- CC) Djikstra's
- DD) Hamiltonian's
3What is used to find the shortest path in a graph?
- ADijkstra's Algorithm
- Bnone of the above
4How would you go about find the shortage path?
- AA.use the path that is not being used
- BB.you add up the path weights between the two points and which ever is smallest
- CC.find the longest path between to points
- DD.none of the above
5Dijkstra's algorithm finds what kind of path between all vertices?
- AA. Longest Path
- BB. Shortest Path.
- CC. Tallest Path
- DD. None of the above
6Which algorithim finds the shortest path between vertex 0 and all other verticies?
- AA) Primm's Algotrithim
- BB) Yoo's Algorithim
- CC) Fermi Algorithim
- DD) Dijkstra's Algorithim
7What is used to find the shortest path of one node to all other nodes?
- ADjikstra's Algorithm
- Bnone
8What aglorithm is used to find the shorest path between two nodes in a graph?
- AA. Depth First Search
- BB. Bubble Sort
- CC. Dijkstra's Algorithm
- DD. Prim's Algorithm
9Dijkstra's algorithm finds the shortest path between a vertex and:
- AA. only one other node
- BB. two other nodes
- CC. all other nodes
- DD. n/a: Dijkstra's algorithm finds the smallest spanning tree.
10What does Dijkstra's algorithm do?
- AA. it finds the longest path between vertex 0 and all other vertices
- BB. it finds the shortest path between vertex v and all other vertices
- CC. it finds the longest path between vertex v and all other vertices
- DD. it finds the shortest path between vertex 0 and all other vertices
11When trying to find the shortest path and you have negative edges in the graph. You can still use Dijkstra’s algorithm?
- ATrue
- BFalse
12Is the definition of Dijkstra's algorithm true or false?
Find the shortest path between vertex 0 and all other vertices- ATrue
- BFalse
13What are the two data structures that Dijkstra's Algorithm uses?
- AA) Two arrays
- BB) Two sets
- CC) A tree and a set
- DD) A set and an array
Information
- Description
- Algorithms and Data Structures | Test 3 Review | CSCI-3110-002 MTSU
- Author
- Mena Sargios
- Language
- English
- Views
- 71
- Tags
- Rating
- No ratings yet Rate this quiz