Data Structure Introduction › Time Complexity › Question #21496
MCQ Single Best Answer Easy

QHow is the time complexity of Dijkstra's algorithm for finding the shortest path in a graph characterized?

ID: #21496 Time Complexity 87 views
Question Info
#21496Q ID
EasyDifficulty
Time ComplexityTopic
Start Quiz on This Topic
 Your Answer

Choose the Best Option

Click any option to instantly check if you're correct.

  • A O(N) ✔ ✖
  • B O(log N) ✔ ✖
  • C O(N^2) ✔ ✖
  • D O(E + V log V), where E is the number of edges and V is the number of vertices. ✔ ✖
Correct Answer: Option D

Explanation

Dijkstra's algorithm has a time complexity of O(E + V log V) for finding the shortest path in a graph.

 Continue Practice
Previous Question Next Question
 Share

Share This Question

Challenge a friend or share with your study group.

 More from This Topic

Related MCQ Questions

What is the time complexity of searching an element in a binary search tree (BST)? What is the time complexity of the selection sort algorithm? How is the time complexity of the bubble sort algorithm in the best-case scenario characterized? How is the time complexity of the radix sort algorithm expressed? How is the time complexity of the hash table (worst case) for searching an element characterized? What is the time complexity of the push operation in a stack data structure? What is the time complexity of a linear search in an unsorted array? How is the time complexity of the binary heap construction expressed? What is the time complexity of the pop operation in a queue data structure? What is the time complexity of the Floyd-Warshall algorithm for all-pairs shortest paths in a weighted graph?