1

GATE CSE 1999

MCQ (Single Correct Answer)

+2

-0.6

If T

(N) T

(O) T

(P) T

(V) T

(W) T

(X) T

_{1}= O(1), give the correct matching for the following pairs:**List - I**

_{n}= T_{n - 1}+ n(N) T

_{n}= T_{n/2}+ n(O) T

_{n}= T_{n/2}+ nlog n(P) T

_{n}= T_{n - 1}+ log n**List - II**

_{n}= O(n)(V) T

_{n}= O(nlogn)(W) T

_{n}= O(n^{2})(X) T

_{n}= O(log^{2}n)2

GATE CSE 1996

MCQ (Single Correct Answer)

+2

-0.6

The minimum number of interchanges needed to convert the array

89, 19, 40, 17, 12, 10, 2, 5, 7, 11, 6, 9, 70

into a heap with the maximum element at the root is3

GATE CSE 1996

MCQ (Single Correct Answer)

+2

-0.6

The average number of key comparisons done on a successful sequential search
in list of length n is

4

GATE CSE 1994

MCQ (Single Correct Answer)

+2

-0.6

Which one of the following statements is false?

Questions Asked from Searching and Sorting (Marks 2)

Number in Brackets after Paper Indicates No. of Questions

GATE CSE 2021 Set 1 (1)
GATE CSE 2018 (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 2009 (2)
GATE CSE 2008 (1)
GATE CSE 2007 (1)
GATE CSE 2006 (3)
GATE CSE 2005 (2)
GATE CSE 2004 (1)
GATE CSE 1999 (1)
GATE CSE 1996 (2)
GATE CSE 1994 (1)
GATE CSE 1992 (1)
GATE CSE 1991 (1)
GATE CSE 1990 (2)

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