Explore topic-wise MCQs in Kruskals Algorithm Multiple Choice.

This section includes 6 Mcqs, each offering curated multiple-choice questions to sharpen your Kruskals Algorithm Multiple Choice knowledge and support exam preparation. Choose a topic below to get started.

1.

Consider the following statements.S1. Kruskal s algorithm might produce a non-minimal spanning tree.

A. nS2. Kruskal s algorithm can efficiently implemented using the disjoint-set data structure.
B. S1 is true but S2 is false
C. Both S1 and S2 are false
D. Both S1 and S2 are true
E. S2 is true but S1 is false
Answer» E. S2 is true but S1 is false
Discussion
2.

Kruskal s algorithm is best suited for the dense graphs than the prim s algorithm.

A. True
B. False
Answer» C.
Discussion
3.

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» D. It uses union-find data structure
Discussion
4.

What is the time complexity of Kruskal s algorithm?

A. O(log V)
B. O(E log V)
C. O(E<sup>2</sup>)
D. O(V log E)
Answer» C. O(E<sup>2</sup>)
Discussion
5.

Kruskal s algorithm is a ______

A. divide and conquer algorithm
B. dynamic programming algorithm
C. greedy algorithm
D. approximation algorithm
Answer» D. approximation algorithm
Discussion
6.

Kruskal s algorithm is used to ______

A. find minimum spanning tree
B. find single source shortest path
C. find all pair shortest path algorithm
D. traverse the graph
Answer» B. find single source shortest path
Discussion