GATE CS 2026 (Forenoon) — Question 49

AlgorithmsMinimum Spanning Trees (Prim/Kruskal Algorithms)MSQ2 marksMedium

Let \( G(V, E) \) be a simple, undirected, edge-weighted graph with unique edge weights. Which of the following statements about the minimum spanning trees (MST) of \( G \) is/are true?
  1. A
    In every cycle \( C \) of \( G \), the edge with the largest weight in \( C \) is not in any MST
  2. B
    In every cycle \( C \) of \( G \), the edge with the smallest weight in \( C \) is in every MST
  3. C
    For every vertex \( v \in V \), the edge with the largest weight incident on \( v \) is not in any MST
  4. D
    For every vertex \( v \in V \), the edge with the smallest weight incident on \( v \) is in every MST
Practise the full 2026-FN paper
Challenge a friend: WhatsApp Telegram
Recommended book · affiliate linkIntroduction to Algorithms (CLRS)The standard reference behind most GATE algorithm questions.
Practise more on Minimum Spanning Trees (Prim/Kruskal Algorithms)Timed, in the real exam interface · free to start

A GATE question every morning

One real past-paper question every morning for your branch, answer hidden until you tap. Free on Telegram.

Join
Stuck? Ask in the student group