Skip to content
Related Articles

Related Articles

Improve Article

GATE | GATE-CS-2006 | Question 11

  • Last Updated : 28 Jun, 2021
Geek Week

Consider a weighted complete graph G on the vertex set {v1, v2, ..vn} such that the weight of the edge (vi, vj) is 2|i-j|. The weight of a minimum spanning tree of G is: (GATE CS 2006)
(A) n — 1
(B) 2n — 2
(C) nC2
(D) 2


Answer: (B)

Explanation: See Question 5 of https://www.geeksforgeeks.org/data-structures-and-algorithms-set-7/

Quiz of this Question

Attention reader! Don’t stop learning now.  Practice GATE exam well before the actual exam with the subject-wise and overall quizzes available in GATE Test Series Course.

Learn all GATE CS concepts with Free Live Classes on our youtube channel.

My Personal Notes arrow_drop_up
Recommended Articles
Page :