![Mcqmate logo](https://mcqmate.com/images/logos/logo-black.png)
![Mcqmate logo](https://mcqmate.com/images/logos/logo-white.png)
McqMate
Q. |
Kruskal’s algorithm is a |
A. | divide and conquer algorithm |
B. | dynamic programming algorithm |
C. | greedy algorithm |
D. | approximation algorithm |
Answer» C. greedy algorithm | |
Explanation: kruskal’s algorithm uses a greedy algorithm approach to find the mst of the connected weighted graph. in the greedy method, we attempt to find an optimal solution in stages. |
View all MCQs in
Design and Analysis of AlgorithmsNo comments yet