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

go_editor asked Jul 30, 2016 • edited Jan 19, 2023 by makhdoom ghaya

3,059 views

2 votes

Consider the given graph

Its Minimum Cost Spanning Tree is ______

Graph Theory
ugcnetcse-june2015-paper2
graph-theory
minimum-spanning-tree

+ –

go_editor asked Jul 30, 2016 • edited Jan 19, 2023 by makhdoom ghaya

go_editor

3.1k views

See all

1 1 comment

papesh

commented Jul 30, 2016

moved

by papesh Sep 24, 2016

B. Is ans...

Option A and C is eliminated since not having 1-6 edge...

D is eliminated since it contains edge weight 28 Even we have choice for smaller edge weight...

0 votes

Please log in or register to add a comment.

Please log in or register to answer this question.

1 Answer

1 votes

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.

Hira Thakur answered Nov 15, 2017

Hira Thakur

See all

0 Please log in or register to add a comment.

Voting & Accepting an answer helps improve the community

Answer:

← Previous Next →

← Previous in category Next in category →

Related questions

3 votes

3 answers

go_editor asked Jul 30, 2016

4,377 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$ $\mid E(G) \mid \geq 1/2 (n-1)(n-2)+2$ edges $\deg(v) + \deg(w) \geq n$ ... $v$ and $\omega$ not connected by an edge $i$ and $ii$ $ii$ and $iii$ $i$ and $iii$ $i$, $ii$, and $iii$

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$...

go_editor

4.4k views

go_editor asked Jul 30, 2016

Graph Theory
ugcnetcse-june2015-paper2
discrete-mathematics
graph-theory

+ –

1 votes

1 answer

go_editor asked Jul 31, 2016

2,947 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 platform The programming model is a distributed memory model All parallelism is implicit MPI- Comm - Size returns the total number of MPI processes in specified communication

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...

go_editor

2.9k views

go_editor asked Jul 31, 2016

Distributed Computing
ugcnetcse-june2015-paper2
parallel-computing
message-passing

+ –

6 votes

3 answers

go_editor asked Jul 31, 2016

5,679 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 deleted Weak entity set avoids the data duplication and consequent possible inconsistencies caused by ... a weak entity set are not partitioned according to their relationship with tuples with a strong entity set

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 ...

go_editor

5.7k views

go_editor asked Jul 31, 2016

Databases
ugcnetcse-june2015-paper2
er-diagram
databases

+ –

0 votes

4 answers

go_editor asked Jul 31, 2016

4,055 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 sort Bubble sort Radix sort Insertion sort

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...

go_editor

4.1k views

go_editor asked Jul 31, 2016

Algorithms
ugcnetcse-june2015-paper2
algorithms-sorting

+ –

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true

1 1 comment reply

Please log in or register to add a comment.

Please log in or register to answer this question.

1 Answer

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.

0 reply

Please log in or register to add a comment.

Related questions

1 1 comment

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.

0