GATE CSE 2000 | Divide and Conquer Method Question 26 | Algorithms

GATE CSE 2000

MCQ (Single Correct Answer)

-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?

t (n) is O(1)

n < t (n) < $$n\log _2^n$$

$$n\log _2^n$$ < t (n) < $$\left( {\matrix{ n \cr 2 \cr } } \right)$$

t(n) = $$\left( {\matrix{ n \cr 2 \cr } } \right)$$

GATE CSE 1999

MCQ (Single Correct Answer)

-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:

8, 9, 15, 20, 47, 4, 12, 17, 30, 40

8, 15, 20, 47, 4, 9, 30, 40, 12, 17

15, 20, 47, 4, 8, 9, 12, 30, 40, 17

4, 8, 9, 15, 20, 47, 12, 17, 30, 40

GATE CSE 1999

MCQ (Single Correct Answer)

-0.3

A sorting technique is called stable if:

It takes O(nlog n)time

It maintains the relative order of occurrence of non-distinct elements

It uses divide and conquer paradigm

It takes O(n) space

GATE CSE 1995

MCQ (Single Correct Answer)

-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 and II

II and III

I and IV

I and III

PREVIOUS NEXT