Skip to content
Related Articles

Related Articles

Improve Article

UGC-NET | UGC NET CS 2016 Aug – III | Question 36

  • Last Updated : 13 Apr, 2018

Match the following:
36
(A) (1)
(B) (2)
(C) (3)
(D) (4)


Answer: (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.

    Quiz of this Question

    My Personal Notes arrow_drop_up
Recommended Articles
Page :