Register

GATE CSE 2003 | Question: 68

• edited by
7,816 views

3 Answers

Best answer
23 votes
23 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
User Avatar
Voting & Accepting an answer helps improve the community
Answer:
← PreviousNext →
← Previous in categoryNext in category →

Related questions

20.2k
views
9 answers
71 votes
go_editor asked Apr 24, 2016
20,226 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...
User Avatar
12.5k
views
7 answers
56 votes
Kathleen asked Sep 17, 2014
12,539 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 $\...
User Avatar
18.0k
views
4 answers
61 votes
Kathleen asked Sep 17, 2014
18,033 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})...
User Avatar
14.6k
views
11 answers
50 votes
Kathleen asked Sep 17, 2014
14,599 views
GATE CSE 2003 | Question: 69
The following are the starting and ending times of activities $A, B, C, D, E, F, G$ and $H$ respectively in chronological order: $“a_s \: b_s \: c_s \: a_e \: d_s \: c_...
User Avatar
Link Copied!