In minimum spanning trees, the cut property is used to justify Prim's…

Bihar STET · PGT (Paper 2) · Computer Science · 2025

1. A.

   A maximum-weight edge in the graph must be part of every MST.

2. B.

   A minimum-weight edge in the graph is the only edge Prim's algorithm can choose.

3. C.

   A minimum-weight edge crossing the current cut is safe to add to an MST.

4. D.

   A maximum-weight edge crossing a cut is safe to add to an MST.

Attempted by 407 students.

The worked solution is available to enrolled students.