1

GATE CSE 1999

MCQ (Single Correct Answer)

+1

-0.3

A sorting technique is called stable if:

2

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:

3

GATE CSE 1995

MCQ (Single Correct Answer)

+1

-0.3

For merging two sorted lists of sizes m and n into a sorted list of size m+n, we require comparisons of

4

GATE CSE 1995

MCQ (Single Correct Answer)

+1

-0.3

Which of the following statements is true?

I. As the number of entries in a hash table increases, the number of collisions increases.

II. Recursive programs are efficient

III. The worst case complexity for Quicksort is O(n

IV. Binary search using a linear linked list is efficient.

I. As the number of entries in a hash table increases, the number of collisions increases.

II. Recursive programs are efficient

III. The worst case complexity for Quicksort is O(n

^{2})IV. Binary search using a linear linked list is efficient.

Questions Asked from Divide and Conquer Method (Marks 1)

Number in Brackets after Paper Indicates No. of Questions

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