- Computer Science Engineering (CSE)
- Design and Analysis of Algorithms
- Kruskal’s algorithm can efficiently impl...

Q. |
## Kruskal’s algorithm can efficiently implemented using the disjoint-set data structure. |

A. | s1 is true but s2 is false |

B. | both s1 and s2 are false |

C. | both s1 and s2 are true |

D. | s2 is true but s1 is false |

Answer» D. s2 is true but s1 is false | |

Explanation: in kruskal’s algorithm, the disjoint-set data structure efficiently identifies the components containing a vertex and adds the new edges. and kruskal’s algorithm always finds the mst for the connected graph. |

View all MCQs in:
Design and Analysis of Algorithms

- Which of the following edges form minimum spanning tree on the graph using kruskals algorithm?
- Prim’s algorithm can be efficiently implemented using for graphs with greater density.
- Which of the following algorithm can be used to solve the Hamiltonian path problem efficiently?
- Fractional knapsack problem is solved most efficiently by which of the following algorithm?
- Which of the following is the most commonly used data structure for implementing Dijkstra’s 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.

Login to Continue

It will take less than 2 minutes

Report MCQ