UTpaper

Free mock tests & test series

Question 193Asked in CIL MT Systems, 27 Feb 2020 (8:00 AM)

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

  1. AInitially the roots key and nodes are initialized to zero.
  2. BIt may use binomial max heap to represent the priority queue.
  3. CThe complexity is O(E log V) using binary heap
  4. DThe time complexity is O(E + V log V) using Fibonacci Heap
Show answerHide answer

Correct answer: (B) It may use binomial max heap to represent the priority queue.

From CIL MT Systems PYQ, 27 Feb 2020 (8:00 AM)

This is question 193 of CIL MT Systems PYQ, 27 Feb 2020 (8:00 AM). See all questions of this paper with answers, or attempt the paper as a timed online test to get your score and all-India rank.