Which of the following statement is false about Prim’s algorithm?

PYQ Coal India Management Trainee CBT 2019Modified — slightly modified from the official paper; see the solution

Which of the following statement is false about Prim’s algorithm?

  1. A.

    Initially the root's key is initialized to 0 and all other nodes to infinity

  2. B.

    It may use binomial max heap to represent the priority queue

  3. C.

    The complexity is O(E log V) using binary heap

  4. D.

    The time complexity is O(E + V log V) using Fibonacci Heap

Attempted by 671 students.

Sign up free to check your answer

Sign up free

Explore the full course: Coal India Management Trainee

Loading lesson…