The Gateway to Computer Science Excellence

First time here? Checkout the FAQ!

x

+28 votes

An undirected graph $G(V,E)$ contains $n \: (n>2)$ nodes named $v_1,v_2, \dots, v_n$. Two nodes $v_i, v_j$ are connected if and only if $ 0 < \mid i-j\mid \leq 2$. Each edge $(v_i,v_j)$ is assigned a weight $i+j$. A sample graph with $n=4$ is shown below.

What will be the cost of the minimum spanning tree (MST) of such a graph with $n$ nodes?

- $\frac{1}{12} (11n^2 - 5 n)$
- $n^2-n+1$
- $6n-11$
- $2n+1$

0

For those interested in recurrence relations, this would look like: $\color{red}{T(n) = T(n-1) + 2n-2}$ with $\color{blue}{T(2) = 3}$ for base case.

+21 votes

Best answer

Q 54. Answer is **B**

$\text{ We observe a pattern in the weight of MST being formed }$

$\text{ For n=3 } (1+2+3)+(1)$

$\text{ For n=4 } (1+2+3+4)+(1+2)$

$\text{ For n=5 } (1+2+3+4+5)+(1+2+3)$

$\text{ These can be obtained by drawing graphs for these graphs. }$

$\therefore \text{ Total weight of MST is } \sum_{i=1}^{n}i+\sum_{i=1}^{n-2}i=n^2-n+1\\$

+18

edge weights in mst:

=3 + 4 + 6 + 8 + 10 + 12 +...+*(2(n-1))

=1+(2+ 4+6+....till n-1 terms)

=1+ 2(1+2+3+4+...n-1)

=1+(n-1)*n=n^{2}-n+1

0

@papesh @abhishekmehta4u why in the end we have 2(n-1). I know, for n vertices in G we get (n-1) edges in MST, but where's the 2 coming from?

Is it because every term is increasing by 2?

+1 vote

+1 vote

**ANSWER is B:**

The pattern that goes with the solution:.

For n=3 (1+2+3)+(1)

For n=4 (1+2+3+4)+(1+2)

For n=5 (1+2+3+4+5)+(1+2+3)

For n= {n(n+1)/2 } + {(n-2)(n-2+1)/2}

={(n^{2}+n)/2} + {(n^{2}-3n+2)/2}

=(n^{2}-3n+2+n2+n)/2

=n^{2}-n+1

0 votes

I drew a graph for n=10 and found answer for Q54) as B and answer for Q55) as C

BUT that is a messy and time consuming procedure ... does anyone have a better approach to the given problem ?

BUT that is a messy and time consuming procedure ... does anyone have a better approach to the given problem ?

+2

Put the values 3,4,5,6...to check using which value the options are giving different anwers, then using the least such value, draw the required graph. In this case n=5 will suffice. You will see that the cost of MST is 21 which is satisfied only by option B. Having found the method you will know where to attach the new node, V6. Then from the new MST find the value of v5 to v6 which will be nothing but 21 + the minimum value to reach to v6 which will be (v4 to v6)=10, thus the answer will be 21+10=31.

- All categories
- General Aptitude 1.3k
- Engineering Mathematics 5.1k
- Digital Logic 2k
- Programming & DS 3.7k
- Algorithms 3.1k
- Theory of Computation 3.9k
- Compiler Design 1.5k
- Databases 2.9k
- CO & Architecture 2.5k
- Computer Networks 2.9k
- Non GATE 1k
- Others 1.3k
- Admissions 446
- Exam Queries 428
- Tier 1 Placement Questions 17
- Job Queries 55
- Projects 8

35,486 questions

42,746 answers

121,453 comments

42,138 users