ExamSIDE.Com

© ExamSIDE.Com 2019

About Us Privacy Policy

GATE CSE 1995 Question

Signle Correct Answer
Merge sort uses
A
Divide and conquer strategy
B
Backtracking approach
C
Heuristic search
D
Greedy approach

GATE CSE 1995 Question

Signle Correct Answer
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)

GATE CSE 1995 Question

Signle Correct Answer
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

GATE CSE 1999 Question

Signle Correct Answer
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

Share