Register

UGC NET CSE | December 2018 | Part 2 | Question: 12

• retagged by
4,385 views
0 votes
0 votes

Consider the graph shown below:

Use Kruskal’s algorithm to find the minimum spanning tree of the graph. The weight of this minimum spanning  tree is

  1. $17$
  2. $14$
  3. $16$
  4. $13$
• retagged by
User Avatar

2 Answers

1 votes
1 votes

Final minimum spanning tree will look like $-$

So the weight is $1+1+1+2+2+2+3+4= 16$

((There are 2MSTs possible ))

User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1 votes
1 votes
1 answer
1
Arjun asked Jan 2, 2019
3,735 views
UGC NET CSE | December 2018 | Part 2 | Question: 23
Consider two sequences $X$ and $Y$ : $X=<0, 1, 2, 1, 3, 0, 1>$ $Y=<1, 3, 2, 0, 1, 0>$ The length of longest common subsequence between $X$ and $Y$ is $2$ $3$ $4$ $5$
Consider two sequences $X$ and $Y$ :$X=<0, 1, 2, 1, 3, 0, 1>$$Y=<1, 3, 2, 0, 1, 0>$The length of longest common subsequence between $X$ and $Y$ is$2$$3$$4$$5$
User Avatar
0 votes
0 votes
1 answer
2
Arjun asked Jan 2, 2019
1,755 views
UGC NET CSE | December 2018 | Part 2 | Question: 27
Match $\text{List I}$ with $\text{List II}$ ... $\text{(a)-(iii), (b)-(i), (c)-(iv), (d)-(ii)}$
Match $\text{List I}$ with $\text{List II}$ and choose the correct answer from the code given below.$\begin{array} {clcl} & \textbf{List I} & & \textbf{List II} \\ & \...
User Avatar
0 votes
0 votes
0 answers
3
Arjun asked Jan 2, 2019
1,135 views
UGC NET CSE | December 2018 | Part 2 | Question: 30
The second smallest of $n$ elements can be found with ____ comparisons in the worst case. $n-1$ $\lg \: n$ $n + ceil(\lg \: n)-2$ $\frac{3n}{2}$
The second smallest of $n$ elements can be found with ____ comparisons in the worst case.$n-1$$\lg \: n$$n + ceil(\lg \: n)-2$$\frac{3n}{2}$
User Avatar
Link Copied!