- Computer Science Engineering (CSE)
- Design and Analysis of Algorithms
- Kruskal’s algorithm is a ...

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 Algorithms

- Which of the following edges form minimum spanning tree on the graph using kruskals algorithm?
- Which algorithm is the most efficient numerical algorithm to obtain lcm?
- Is Coppersmith-Winograd algorithm better than Strassen’s algorithm in terms of time complexity?
- The naive pattern searching algorithm is an in place algorithm.
- Rabin Karp algorithm and naive pattern searching algorithm have the same worst case time complexity.
- Kruskal’s algorithm is best suited for the dense graphs than the prim’s algorithm.
- Prim’s algorithm resembles Dijkstra’s algorithm.
- Kruskal’s algorithm is best suited for the sparse graphs than the prim’s algorithm.
- The running time of Bellmann Ford algorithm is lower than that of Dijkstra’s Algorithm.
- Dijikstra’s Algorithm is more efficient than Bellmann Ford Algorithm.

Login to Continue

It will take less than 2 minutes

Report MCQ