1
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
2
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
A
O(m)
B
O(n)
C
O(m+n)
D
O(log m + log n)
3
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(n2)
IV. Binary search using a linear linked list is efficient.
A
I and II
B
II and III
C
I and IV
D
I and III
4
GATE CSE 1995
MCQ (Single Correct Answer)
+1
-0.3
Merge sort uses
A
Divide and conquer strategy
B
Backtracking approach
C
Heuristic search
D
Greedy approach
GATE CSE Subjects
Software Engineering
Web Technologies
EXAM MAP
Medical
NEET
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
CBSE
Class 12