1
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.
2
GATE CSE 1995
MCQ (Single Correct Answer)
+1
-0.3
Merge sort uses
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