Aug2016 cs Q36
| a. Prim's algorithm | i. O(V2E) |
| b. Bellman-Ford algorithm | ii. O(VE lgV) |
| c. Floyd-warshall algorithm | iii. O(E lgV) |
| d. Johnson's algorithm | iv. O(V3) |
Where V is the set of nodes and E is the set of edges in the graph.Codes:
| a | b | c | d | |
| (1) | i | iii | iv | ii |
| (2) | i | iii | ii | iv |
| (3) | iii | i | iv | ii |
| (4) | iii | i | ii | iv |
- Option : C
- Explanation :
- Prim’s algorithm takes O(E lgV) time.
- Bellman-Ford algorithm takes O(V2E) time.
- Floyd-Warshall algorithm takes O(V3) time.
- Johnson’s algorithm takes O(VE lgV) time.
So, option (C) is correct.
You must be logged in to post a comment.
You must be logged in to post a comment.