Algorithms · Minimum Spanning Trees
Official IIT answer key · IIT Bombay · Audited Aug 2026
GATE CSE 2021 Set 2 Q1 · MCQ · 1 mark
Key concept
No account needed
Sit 5 related Minimum Spanning TreesPYQs as a guest. We'll score the set and show which traps cost marks — sign in only if you want to save the run.
Topic notes
Minimum Spanning Trees (MST) in GATE CS is tested heavily via theoretical properties (Cut and Cycle theorems), counting the number of distinct MSTs using Kruskal's stage-by-stage component logic, and parameterized/algebraic graph constructions. Questions frequently explore fundamental cycle edge swaps, algorithm time complexities for dynamic updates, and the structural relationship between graph shortest paths and tree paths.
Full Minimum Spanning Trees guide →Let G be a connected undirected weighted graph. Consider the following two statements. S1 : There exists a minimum weight edge in G which is present in every minimum spanning tree of G. S2 : If every edge in G has distinct weight, then G has a unique minimum spanning tree. Which one of the following options is correct?
Topic-wise GATE CS PYQs with verified steps
Independent practice explanation verified by the GateAI team. GATE is conducted by the IITs; question text follows the official paper.
