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?
A
O(n)
B
O(n Log n)
C
O(n2)
D
O(n!)
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?
A
t (n) is O(1)
B
n < t (n) < $$n\log _2^n$$
C
$$n\log _2^n$$ < t (n) < $$\left( {\matrix{ n \cr 2 \cr } } \right)$$
D
t(n) = $$\left( {\matrix{ n \cr 2 \cr } } \right)$$
3
GATE CSE 1999
MCQ (Single Correct Answer)
+1
-0.3
A sorting technique is called stable if:
A
It takes O(nlog n)time
B
It maintains the relative order of occurrence of non-distinct elements
C
It uses divide and conquer paradigm
D
It takes O(n) space
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:
A
8, 9, 15, 20, 47, 4, 12, 17, 30, 40
B
8, 15, 20, 47, 4, 9, 30, 40, 12, 17
C
15, 20, 47, 4, 8, 9, 12, 30, 40, 17
D
4, 8, 9, 15, 20, 47, 12, 17, 30, 40
GATE CSE Subjects
Software Engineering
Web Technologies
EXAM MAP
Medical
NEET
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
Civil Services
UPSC Civil Service
Defence
NDA
CBSE
Class 12