Dijkstra's Algorithm

Choose difficulty:

Beginner

Intermediate

Advanced

1. What is the time complexity of insertion at any point on an array?

a: O(N) Explanation

Explanation

b: O(N^2) Explanation

Explanation

c: O(NLogN) Explanation

Explanation

d: None of these Explanation

Explanation

2. What is the space complexity of Dijikstra’s algorithm? (V is the number of vertices in the graph)

a: O(V) Explanation

Explanation

b: O(V^2) Explanation

Explanation

c: O(log V) Explanation

Explanation

d: None of the above Explanation

Explanation

3. What is the order of time complexities of BellmanFord(B), Dijkstra's(D) and Floyd Warshall(F) Algorithms.

a: D > B > F Explanation

Explanation

b: B > D > F Explanation

Explanation

c: D > F > B Explanation

Explanation

d: F > B > D Explanation

Explanation

Community Links Sakshat Portal Outreach Portal FAQ: Virtual Labs

AGPL 3.0 & Creative Commons (CC BY-NC-SA 4.0)