1

GATE CSE 2003

MCQ (Single Correct Answer)

+2

-0.6

Let G = (V, E) be a directed graph with n vertices. A path from v

$$$A[j,k] = \left\{ {\matrix{ {1\,if\,(j,\,k)} \cr {1\,otherwise} \cr } } \right.$$$ Consider the following algorithm.

_{i}to v_{j}in G is sequence of vertices (v_{i}, v_{i}+1, ……., v_{j}) such that (v_{k}, v_{k}+1) ∈ E for all k in i through j – 1. A simple path is a path in which no vertex appears more than once. Let A be an n x n array initialized as follow$$$A[j,k] = \left\{ {\matrix{ {1\,if\,(j,\,k)} \cr {1\,otherwise} \cr } } \right.$$$ Consider the following algorithm.

```
for i = 1 to n
for j = 1 to n
for k = 1 to n
A [j , k] = max (A[j, k] (A[j, i] + A [i, k]);
```

Which of the following statements is necessarily true for all j and k after terminal of the above algorithm ?2

GATE CSE 2003

MCQ (Single Correct Answer)

+2

-0.6

What is the weight of a minimum spanning tree of the following graph?

3

GATE CSE 2000

MCQ (Single Correct Answer)

+2

-0.6

Let G be an undirected connected graph with distinct edge weight. Let emax be the edge with maximum weight and emin the edge with minimum weight. Which of the following statements is false?

4

GATE CSE 1992

Fill in the Blanks

+2

-0

Complexity of Kruskal’s algorithm for finding the minimum spanning tree of an undirected graph containing n vertices and m edges if the edges are sorted is _______.

Questions Asked from Greedy Method (Marks 2)

Number in Brackets after Paper Indicates No. of Questions

GATE CSE 2024 Set 2 (2)
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