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

Question

Computer Science · Graph Theory

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 Graph Theory?

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

Recommended practice questions in Computer Science · Graph Theory

The 'Drain of Wealth' theory was propounded by which Indian nationalist leader?

Which event is considered the turning point in Mahatma Gandhi's leadership in the Indian independence movement?

Which African leader is known for his non-violent opposition to colonial rule?

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