Dijkstra’s Algorithm MCQ

Test your knowledge with important Dijkstra’s Algorithm MCQ and their applications. These MCQs are beneficial for competitive exams too. Explore 30 + more Dijkstra’s Algorithm MCQs at Bissoy

• Dijkstra’s Algorithm is the prime example for ___________
  ক

  Greedy algorithm

  খ

  Branch and bound

  গ

  Back tracking

  ঘ

  Dynamic programming
• In the given graph, identify the shortest path having minimum cost to reach vertex E if A is the source vertex.
  ক

  a-b-e

  খ

  a-c-e

  গ

  a-c-d-e

  ঘ

  a-c-d-b-e
• Consider the following graph. If b is the source vertex, what is the minimum cost to reach f vertex?
  ক

  8

  খ

  9

  গ

  4

  ঘ

  6
• The running time of Bellmann Ford algorithm is lower than that of Dijkstra’s Algorithm.
  ক

  True

  খ

  False
• What is running time of Dijkstra’s algorithm using Binary min- heap method?
  ক

  O(V)

  খ

  O(VlogV)

  গ

  O(E)

  ঘ

  O(ElogV)
• The maximum number of times the decrease key operation performed in Dijkstra’s algorithm will be equal to ___________
  ক

  Total number of vertices

  খ

  Total number of edges

  গ

  Number of vertices – 1

  ঘ

  Number of edges – 1
• How many times the insert and extract min operations are invoked per vertex?
  ক

  1

  খ

  2

  গ

  3

  ঘ

  0
• How many priority queue operations are involved in Dijkstra’s Algorithm?
  ক

  1

  খ

  3

  গ

  2

  ঘ

  4
• Dijkstra’s Algorithm cannot be applied on ______________
  ক

  Directed and weighted graphs

  খ

  Graphs having negative weight function

  গ

  Unweighted graphs

  ঘ

  Undirected and unweighted graphs
• What is the time complexity of Dijikstra’s algorithm?
  ক

  O(N)

  খ

  O(N3)

  গ

  O(N2)

  ঘ

  O(logN)
• Which of the following is the most commonly used data structure for implementing Dijkstra’s Algorithm?
  ক

  Max priority queue

  খ

  Stack

  গ

  Circular queue

  ঘ

  Min priority queue