Mena Sargios
Quiz by , created more than 1 year ago

Algorithms and Data Structures | Test 3 Review | CSCI-3110-002 MTSU

36
1
0
Mena Sargios
Created by Mena Sargios over 7 years ago
Close

14. Graph Shrtest Path

Question 1 of 13

1

What is the purpose of Dijkstra's algorithm (what problem does it solve)?

Select one of the following:

  • Dijkstra's finds the shortest path from an initial vertex to all of the other vertices.

  • none of the above

Explanation

Question 2 of 13

1

A common algorithm for finding the shortest path on a graph is ___.

Select one of the following:

  • A) Huffman's

  • B) Euler's

  • C) Djikstra's

  • D) Hamiltonian's

Explanation

Question 3 of 13

1

What is used to find the shortest path in a graph?

Select one of the following:

  • Dijkstra's Algorithm

  • none of the above

Explanation

Question 4 of 13

1

How would you go about find the shortage path?

Select one of the following:

  • 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

Explanation

Question 5 of 13

1

Dijkstra's algorithm finds what kind of path between all vertices?

Select one of the following:

  • A. Longest Path

  • B. Shortest Path.

  • C. Tallest Path

  • D. None of the above

Explanation

Question 6 of 13

1

Which algorithim finds the shortest path between vertex 0 and all other verticies?

Select one of the following:

  • A) Primm's Algotrithim

  • B) Yoo's Algorithim

  • C) Fermi Algorithim

  • D) Dijkstra's Algorithim

Explanation

Question 7 of 13

1

What is used to find the shortest path of one node to all other nodes?

Select one of the following:

  • Djikstra's Algorithm

  • none

Explanation

Question 8 of 13

1

What aglorithm is used to find the shorest path between two nodes in a graph?

Select one of the following:

  • A. Depth First Search

  • B. Bubble Sort

  • C. Dijkstra's Algorithm

  • D. Prim's Algorithm

Explanation

Question 9 of 13

1

Dijkstra's algorithm finds the shortest path between a vertex and:

Select one of the following:

  • A. only one other node

  • B. two other nodes

  • C. all other nodes

  • D. n/a: Dijkstra's algorithm finds the smallest spanning tree.

Explanation

Question 10 of 13

1

What does Dijkstra's algorithm do?

Select one of the following:

  • 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

Explanation

Question 11 of 13

1

When trying to find the shortest path and you have negative edges in the graph. You can still use Dijkstra’s algorithm?

Select one of the following:

  • True
  • False

Explanation

Question 12 of 13

1

Is the definition of Dijkstra's algorithm true or false?

Find the shortest path between vertex 0 and all other vertices

Select one of the following:

  • True
  • False

Explanation

Question 13 of 13

1

What are the two data structures that Dijkstra's Algorithm uses?

Select one of the following:

  • A) Two arrays

  • B) Two sets

  • C) A tree and a set

  • D) A set and an array

Explanation

Previous
Check answer
Next