MCQOPTIONS
Bookmark
Saved Bookmarks
→
General Awareness
→
Banking Innovation in India in General Awareness
→
What is the time complexity of Dijikstra’s algor..
1.
What is the time complexity of Dijikstra’s algorithm?
A.
O(N)
B.
O(N3)
C.
O(N2)
D.
O(logN)
Answer» D.
Show Answer
Discussion
No Comment Found
Post Comment
Related MCQs
Dijkstra’s Algorithm is the prime example for ___________
In the given graph, identify the shortest path having minimum cost to reach vertex E if A is the source vertex.
Consider the following graph.
The maximum number of times the decrease key operation performed in Dijkstra’s algorithm will be equal to ___________
What is the pseudo code to compute the shortest path in Dijkstra’s algorithm?
Dijkstra’s Algorithm cannot be applied on ______________
What is the time complexity of Dijikstra’s algorithm?
Dijkstra’s Algorithm is used to solve _____________ problems.
Reply to Comment
×
Name
*
Email
*
Comment
*
Submit Reply