Dijkstra's Algorithm

Dijkstra’s Algorithm is used to solve _____________ problems.

• All pair shortest path

• Single source shortest path

• Network flow

• Sorting

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

What is the time complexity of Dijikstra’s algorithm?

• O(N)

• O(N³)

• O(N²)

• O(logN)

Dijkstra’s Algorithm cannot be applied on ______________

• Directed and weighted graphs

• Graphs having negative weight function

• Unweighted graphs

• Undirected and unweighted graphs

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

• 1

• 3

• 2

• 4

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

a) a-b-e
b) a-c-e
c) a-c-d-e
d) a-c-d-b-e

• a-b-e

• a-c-e

• a-c-d-e

• a-c-d-b-e