McqMate
| 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 |
| 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. | |
View all MCQs in
Design and Analysis of AlgorithmsNo comments yet