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
πŸ’¬ Discuss
βœ… Correct Answer: (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

Published by Mr. Dubey ⭐ 104.82K Points at 16-Sep-2023 03:43 pm in Design and Analysis of Algorithms

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

πŸ’¬ Discussion

Related MCQs

Q. Which of the following is true about Residuals ?

Q. In SQL the cross-tabs are created using

Q. The contains a list of blocks that have been updated in the database buffer.

Q. Which of the following is true about templates? 1) Template is a feature of C++ that allows us to write one code for different data types. 2) We can w

Q. The addressing mode which makes use of in-direction pointers is ______

Q. Thread pools help in

Q. When all nodes are connected to a central hub, it is topology.

Q. Structural complexity of a module i is given as S(i) = f*f (i). What does f symbolizes here?

Q. directive specifies the start of the execution.

Q. Which of the following statements are true for a design matrix X ∈ Rn×d with d > n? (The rows are n sample points and the columns repres

πŸ“Š Question Analytics

πŸ‘οΈ
538
Total Visits
πŸ“½οΈ
3 y ago
Published
πŸŽ–οΈ
Mr. Dubey
Publisher
πŸ“ˆ
81%
Success Rate