1
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?
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 1999
MCQ (Single Correct Answer)
+1
-0.3
A sorting technique is called stable if:
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(n2)
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(n2)
IV. Binary search using a linear linked list is efficient.
GATE CSE Subjects
Theory of Computation
Operating Systems
Algorithms
Digital Logic
Database Management System
Data Structures
Computer Networks
Software Engineering
Compiler Design
Web Technologies
General Aptitude
Discrete Mathematics
Programming Languages
Computer Organization