Data Structure II Mock Test 3

10%

Question 1 of 10

1. Which of the following is the distribution sort?

Smooth sort

Heap sort

Quick sort

LSD radix sort

Question 1 of 10

Question 2 of 10

2. What is the average case time complexity of recursive insertion sort?

O(n log n)

O(n²)

O(n)

O(log n)

Question 2 of 10

Question 3 of 10

3. Pigeonhole sort is an in place sorting algorithm.

true

false

Question 3 of 10

Question 4 of 10

4. What is the average case time complexity of tree sort?

O(n log n)

O(log n)

O(n)

O(n²)

Question 4 of 10

Question 5 of 10

5. What is the auxiliary space requirement of bogosort?

O(n)

O(1)

O(n log n)

O(log n)

Question 5 of 10

Question 6 of 10

6. Which of the following is a combination of LSD and MSD radix sorts?

Flash sort

3-way radix quick sort

Forward radix sort

Trie base radix sort

Question 6 of 10

Question 7 of 10

7. Which of the following is not true about bucket sort?

It is in place sorting algorithm

It can also be considered as comparison based sort

It is a distribution sort

It is a non comparison based integer sort

Question 7 of 10

Question 8 of 10

8. How many comparisons will be made to sort the array arr={1,5,3,8,2} using counting sort?

Question 8 of 10

Question 9 of 10

9. What is the advantage of counting sort over quick sort?

counting sort has lesser time complexity when range is comparable to number of input elements

counting sort has lesser space complexity

it has no advantage

counting sort is not a comparison based sorting technique

Question 9 of 10

Question 10 of 10

10. Which of the following is false?

LSD radix sort is a comparison sorting algorithm

LSD radix sort uses bucket sort

LSD radix sort is a distribution sort

LSD radix sort is an integer sorting algorithm

Question 10 of 10