1

GATE CSE 2011

MCQ (Single Correct Answer)

+2

-0.6

An undirected graph G(V, E) contains n ( n > 2 ) nodes named v

_{1}, v_{2},….v_{n}. Two nodes v_{i }, v_{j}are connected if and only if 0 < |i – j| <= 2. Each edge (v_{i}, v_{j}) is assigned a weight i + j. A sample graph with n = 4 is shown below. What will be the cost of the minimum spanning tree (MST) of such a graph with n nodes?2

GATE CSE 2011

MCQ (Single Correct Answer)

+2

-0.6

An undirected graph G(V, E) contains n ( n > 2 ) nodes named v

_{1}, v_{2},….v_{n}. Two nodes v_{i }, v_{j}are connected if and only if 0 < |i – j| <= 2. Each edge (v_{i}, v_{j}) is assigned a weight i + j. A sample graph with n = 4 is shown below. The length of the path from v5 to v6 in the MST of previous question with n = 10 is3

GATE CSE 2010

MCQ (Single Correct Answer)

+2

-0.6

Consider a complete undirected graph with vertex set {0, 1, 2, 3, 4}. Entry W(ij) in the matrix W below is the weight of the edge {i, j}.
$$$w = \left( {\matrix{
0 & 1 & 8 & 1 & 4 \cr
1 & 0 & {12} & 4 & 9 \cr
8 & {12} & 0 & 7 & 3 \cr
1 & 4 & 7 & 0 & 2 \cr
4 & 9 & 3 & 2 & 0 \cr
} } \right)$$$
What is the minimum possible weight of a spanning tree T in this graph such that vertex 0 is a leaf node in the tree T?

4

GATE CSE 2010

MCQ (Single Correct Answer)

+2

-0.6

Consider a complete undirected graph with vertex set {0, 1, 2, 3, 4}. Entry W(ij) in the matrix W below is the weight of the edge {i, j}.
$$$w = \left( {\matrix{
0 & 1 & 8 & 1 & 4 \cr
1 & 0 & {12} & 4 & 9 \cr
8 & {12} & 0 & 7 & 3 \cr
1 & 4 & 7 & 0 & 2 \cr
4 & 9 & 3 & 2 & 0 \cr
} } \right)$$$
What is the minimum possible weight of a path P from vertex 1 to vertex 2 in this graph such that P contains at most 3 edges?

Questions Asked from Greedy Method (Marks 2)

Number in Brackets after Paper Indicates No. of Questions

GATE CSE 2020 (2)
GATE CSE 2018 (2)
GATE CSE 2016 Set 1 (2)
GATE CSE 2015 Set 1 (1)
GATE CSE 2015 Set 2 (1)
GATE CSE 2014 Set 2 (2)
GATE CSE 2012 (1)
GATE CSE 2011 (2)
GATE CSE 2010 (2)
GATE CSE 2009 (1)
GATE CSE 2008 (1)
GATE CSE 2007 (4)
GATE CSE 2006 (1)
GATE CSE 2004 (1)
GATE CSE 2003 (3)
GATE CSE 2000 (1)
GATE CSE 1992 (1)
GATE CSE 1991 (2)

GATE CSE Subjects

Theory of Computation

Operating Systems

Algorithms

Database Management System

Data Structures

Computer Networks

Software Engineering

Compiler Design

Web Technologies

General Aptitude

Discrete Mathematics

Programming Languages