1

GATE CSE 2015 Set 3

MCQ (Single Correct Answer)

+1

-0.3

Consider the following array of elements.

$$\,\,\,\,\,\,\,\,$$$$〈89, 19, 50, 17, 12, 15, 2, 5, 7, 11, 6, 9, 100〉$$

The minimum number of interchanges needed to convert it into a max-heap is2

GATE CSE 2014 Set 2

MCQ (Single Correct Answer)

+1

-0.3

A priority queue is implemented as a Max-Heap. Initially, it has 5 elements. The level-order
traversal of the heap is: 10, 8, 5, 3, 2. Two new elements 1 and 7 are inserted into the heap in that
order. The level-order traversal of the heap after the insertion of the elements is:

3

GATE CSE 2011

MCQ (Single Correct Answer)

+1

-0.3

A max-heap is a heap where the value of each parent is greater than or equal to the value of its children. Which of the following is a max-heap?

4

GATE CSE 2009

MCQ (Single Correct Answer)

+1

-0.3

What is the number of swaps required to sort n elements using selection sort, in
the worst case?

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 1 (1)
GATE CSE 2015 Set 2 (1)
GATE CSE 2015 Set 3 (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

Discrete Mathematics

Programming Languages

Theory of Computation

Operating Systems

Computer Organization

Database Management System

Data Structures

Computer Networks

Algorithms

Compiler Design

Software Engineering

Web Technologies

General Aptitude