Given below are two statements, one labelled as Assertion (A) and the other labelled as Reason (R): Assertion (A): Both Kruskal's algorithm and Prim's algorithm always find a minimum spanning tree in a connected weighted undirected graph. Reason (R): The minimum spanning tree produced for any graph by Kruskal's algorithm and Prim's algorithm is always unique. In light of the above statements, choose the correct answer from the options given below:

Question

Computer Science · Data Structures and Algorithms

Verified Solution4 OptionsUpdated: October 2026👁️1 View

Share:

Correct answer

(A) is true, but (R) is false

Save this question and verified answer as a clean study sheet with live clickable link.

👥

Challenge your peer aspirants on WhatsApp or Telegram to solve this question!

Online Test Series

Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.

Chapter Practice

Want more practice questions on Data Structures and Algorithms?

Solve complete topic-wise tests with detailed solutions on GkGet.

Recommended practice questions in Computer Science · Data Structures and Algorithms

The arrival of which commission in India triggered widespread protests, including mass hartals across the country in 1928?

Which of the following leaders was instrumental in initiating and leading India’s struggle for independence?

Answer 1

Both (A) and (R) are true and (R) is the correct explanation of (A)

Answer 2

Both (A) and (R) are true but (R) is not the correct explanation of (A)

Answer 3

(A) is true, but (R) is false

Answer 4

(A) is false, but (R) is true

Related Practice Questions