1

GATE CSE 2001

MCQ (Single Correct Answer)

+1

-0.3

Randomized quicksort is an extension of quicksort where the pivot is chosen randomly. What is the worst case complexity of sorting n numbers using randomized quicksort?

2

GATE CSE 2000

MCQ (Single Correct Answer)

+1

-0.3

Let s be a sorted array of n integers. Let t(n) denote the time taken for the most efficient algorithm to determined if there are two elements with sum less than 1000 in s. which of the following statements is true?

3

GATE CSE 1999

MCQ (Single Correct Answer)

+1

-0.3

A sorting technique is called stable if:

4

GATE CSE 1999

MCQ (Single Correct Answer)

+1

-0.3

If one uses straight two-way merge sort algorithm to sort the following elements in ascending order 20, 47, 15, 8, 9, 4, 40, 30, 12, 17
then the order of these elements after the second pass of the algorithm is:

Questions Asked from Divide and Conquer Method (Marks 1)

Number in Brackets after Paper Indicates No. of Questions

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