Top 80+ Solved Searching, Sorting and Hashing Techniques MCQ Questions Answer

a. Algorithm that uses tape or disk during the sort

b. Algorithm that uses main memory during the sort

c. Algorithm that involves swapping

d. Algorithm that are considered ‘in place’

a. Algorithm that uses tape or disk during the sort

b. Algorithm that uses main memory during the sort

c. Algorithm that involves swapping

d. Algorithm that are considered ‘in place’

a. O(nlogn)

b. O(logn)

c. O(n)

d. O(n2)

a. O(nlogn)

b. O(logn)

c. O(n)

d. O(n2)

a. It is faster

b. Consumes less memory

c. Detects whether the input is already sorted

d. Consumes less time

a. 4

b. 2

a. O(nlogn)

b. O(logn)

c. O(n)

d. O(n2)

a. 4

b. 2

a. It needs O(1) or O(logn) memory to create auxiliary locations

b. The input is already sorted and in-place

c. It requires additional storage

d. It requires additional space

a. The input is already sorted

b. A large file has to be sorted

c. Large values need to be sorted with small keys

d. Small values need to be sorted with large keys

a. O(nlogn)

b. O(logn)

c. O(n)

d. O(n2)

a. It requires no additional storage space

b. It is scalable

c. It works best for inputs which are already sorted

d. It is faster than any other sorting technique

a. O(nlogn)

b. O(logn)

c. O(n)

d. O(n2)

a. It requires auxiliary memory

b. It is not scalable

c. It can be used for small keys8

d. It takes linear time to sort the elements

a. 5 and 4

b. 4 and 5

c. 2 and 4

d. 2 and 5