GATE CS 2020 (Forenoon) — Question 59

AlgorithmsMinimum Spanning Trees (Prim/Kruskal Algorithms)NAT2 marksMedium

Consider a graph \( G = (V, E) \), where \( V = \{v_1, v_2, ..., v_{100}\} \), \( E = \{(v_i, v_j) \mid 1 \le i < j \le 100\} \) and weight of the edge \( (v_i, v_j) \) is \( |i - j| \). The weight of minimum spanning tree of \( G \) is ________.
Practise the full 2020-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