1

GATE CSE 2003

MCQ (Single Correct Answer)

+1

-0.3

In a heap with n elements with the smallest element at the root, the 7

^{th}smallest element can be found in time2

GATE CSE 2001

MCQ (Single Correct Answer)

+1

-0.3

Consider any array representation of an n element binary heap where the
elements are stored from index 1 to index n of the array. For the element stored
at index i of the array $$\left( {i \le n} \right)$$, the index of the parent is

3

GATE CSE 1999

MCQ (Single Correct Answer)

+1

-0.3

Suppose we want to arrange the n numbers stored in any array such that all
negative values occur before all positive ones. Minimum number of exchanges
required in the worst case is

4

GATE CSE 1999

MCQ (Single Correct Answer)

+1

-0.3

The number of articulation points of the following graph is

Questions Asked from Searching and Sorting (Marks 1)

Number in Brackets after Paper Indicates No. of Questions

GATE CSE 2019 (1)
GATE CSE 2016 Set 2 (1)
GATE CSE 2016 Set 1 (1)
GATE CSE 2015 Set 3 (1)
GATE CSE 2015 Set 2 (1)
GATE CSE 2015 Set 1 (1)
GATE CSE 2014 Set 2 (1)
GATE CSE 2011 (1)
GATE CSE 2009 (1)
GATE CSE 2008 (2)
GATE CSE 2007 (2)
GATE CSE 2006 (3)
GATE CSE 2004 (1)
GATE CSE 2003 (1)
GATE CSE 2001 (1)
GATE CSE 1999 (2)
GATE CSE 1998 (1)
GATE CSE 1997 (1)

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