Home / Engineering / Design and Analysis of Algorithms / Question

M

Mr. Dubey • 51.17K Points
Coach

Q.) Which of the following is false about Prim’s algorithm?

(A) it is a greedy algorithm
(B) it constructs mst by selecting edges in increasing order of their weights
(C) it never accepts cycles in the mst
(D) it can be implemented using the fibonacci heap
Correct answer : Option (B) - it constructs mst by selecting edges in increasing order of their weights

Explanation:
 prim’s algorithm can be implemented using fibonacci heap and it never accepts cycles. and prim’s algorithm follows greedy approach. prim’s algorithms

Share

Discusssion

Login to discuss.