Register

UGC NET CSE | Junet 2015 | Part 2 | Question: 21

• edited by
3,809 views
2 2 votes

Consider the given graph

Its Minimum Cost Spanning Tree is ______

1 Answer

1 1 vote

finding MST using Kruskal’s algorithm steps as follow:

1. Sort all the edges in non-decreasing order of their weight.
2. Pick the smallest edge. Check if it forms a cycle with the spanning tree formed so far. If cycle is not formed, include this edge. Else, discard it.
3. continue step 2 until we have (V-1) edges in the spanning tree.

 

Voting & Accepting an answer helps improve the community
Answer:
← Previous · UGC NET CSE | Junet ...Next → · UGC NET CSE | Junet ...
← Previous in category · UGC NET CSE | Junet ...Next in category → · graph theory (group)
Position:
Show:

Related questions

3 3 votes
3 3 answers
5.8k
5.8k views
go_editor asked Jul 30, 2016
5,770 views
UGC NET CSE | Junet 2015 | Part 2 | Question: 5
Consider a Hamiltonian Graph(G) with no loops and parallel edges. Which of the following is true with respect to this graph (G)?$\deg (v) \geq n/2$ for each vertex of $G$...
1 1 vote
1 1 answer
3.5k
3.5k views
go_editor asked Jul 31, 2016
3,483 views
UGC NET CSE | Junet 2015 | Part 2 | Question: 50
Which of the following is not valid with reference to Message Passing Interface(MPI)?MPI can run on any hardware platformThe programming model is a distributed memory mod...
7 7 votes
3 answers 3 answers
8.2k
8.2k views
go_editor asked Jul 31, 2016
8,170 views
UGC NET CSE | Junet 2015 | Part 2 | Question: 49
Which of the following statements is false about weak entity set?Weak entities can be deleted automatically when their strong entity is deletedWeak entity set avoids the ...
2 2 votes
4 answers 4 answers
5.7k
5.7k views
go_editor asked Jul 31, 2016
5,745 views
UGC NET CSE | Junet 2015 | Part 2 | Question: 48
Which of the following algorithms sort $n$ integers, having the range $0$ to $(n^2 -1)$, in ascending order in $O(n)$ time?Selection sortBubble sortRadix sortInsertion so...