Register

GATE CSE 2003 | Question: 68

• edited by
12,335 views

3 Answers

Best answer
36 36 votes

Apply Prim's algorithm, start from $A$ as shown in figure below.

Add all the weights in the given figure which will be equal to $31$.

Correct Answer: $B$

• edited by
6 6 votes

Use kruskals algorithm

31 is the answer

Voting & Accepting an answer helps improve the community
Answer:
← Previous · GATE CSE 2003 | Ques...Next → · GATE CSE 2003 | Ques...
← Previous in category · GATE CSE 2003 | Ques...Next in category → · GATE CSE 2003 | Ques...
Position:
Show:

Related questions

61 61 votes
5 answers 5 answers
14.5k
14.5k views
Kathleen asked Sep 17, 2014
14,535 views
GATE CSE 2003 | Question: 60, ISRO2007-45
A program consists of two modules executed sequentially. Let $f_1(t)$ and $f_2(t)$ respectively denote the probability density functions of time taken to execute the two ...
94 94 votes
11 answers 11 answers
31.2k
31.2k views
go_editor asked Apr 24, 2016
31,173 views
GATE CSE 2003 | Question: 62
In a permutation $a_1\ldots a_n$, of $n$ distinct integers, an inversion is a pair $(a_i, a_j)$ such that $i < j$ and $a_i a_j.$What would be the worst case time complex...
70 70 votes
9 answers 9 answers
19.9k
19.9k views
Kathleen asked Sep 17, 2014
19,891 views
GATE CSE 2003 | Question: 88
In the following $C$ program fragment, $j$, $k$, $n$ and TwoLog_n are integer variables, and $A$ is an array of integers. The variable $n$ is initialized to an integer $\...
75 75 votes
5 answers 5 answers
28.4k
28.4k views
Kathleen asked Sep 17, 2014
28,424 views
GATE CSE 2003 | Question: 70
Let $G= (V,E)$ be a directed graph with $n$ vertices. A path from $v_i$ to $v_j$ in $G$ is a sequence of vertices ($v_{i},v_{i+1}, \dots , v_j$) such that $(v_k, v_{k+1})...