Which of the following is false about the Kruskal’s algorithm?

M

Mr. Dubey

🎓 Coach ⭐ 103.11K Points

📊 Design and Analysis of Algorithms

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

(A) it is a greedy algorithm
(B) it constructs mst by selecting edges in increasing order of their weights
(C) it can accept cycles in the mst
(D) it uses union-find data structure

💬 Discuss

✅ Correct Answer: (C) it can accept cycles in the mst

Explanation: kruskal’s algorithm is a greedy algorithm to construct the mst of the given graph. it constructs the mst by selecting edges in increasing order of their weights and rejects an edge if it may form the cycle. so, using kruskal’s algorithm is never formed.

Explanation by: Mr. Dubey

kruskal’s algorithm is a greedy algorithm to construct the mst of the given graph. it constructs the mst by selecting edges in increasing order of their weights and rejects an edge if it may form the cycle. so, using kruskal’s algorithm is never formed.

💬 Discussion

📊 Question Analytics

👁️

585

Total Visits

📽️

2 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

83%

Success Rate