Data Structure II Mock Test 3

10%

Question 1 of 10

1. Odd-even sort is a comparison based sort.

false

true

Question 1 of 10

Question 2 of 10

2. Auxiliary space requirement of sleep sort is ___________

O(n)

O(log n)

O(1)

O(max(input))

Question 2 of 10

Question 3 of 10

3. What is the best time complexity of bucket sort (k= number of buckets)?

O(n + k)

O(n log n)

O(n.k)

O(n²)

Question 3 of 10

Question 4 of 10

4. What is the worst case time complexity of permutation sort?

O(n²)

O(n*n!)

O(infinity)

O(n log n)

Question 4 of 10

Question 5 of 10

5. What is the worst case time complexity of gnome sort?

O(n log n)

O(n)

O(n²)

O(log n)

Question 5 of 10

Question 6 of 10

6. Sleep sort code cannot compile online because ___________

it requires multithreading process

online compilers are not efficient

it has very high time complexity

it has very high space complexity

Question 6 of 10

Question 7 of 10

7. What is the best case time complexity of tree sort?

O(n log n)

O(log n)

O(n)

O(n²)

Question 7 of 10

Question 8 of 10

8. What is the average case time complexity of permutation sort?

O(n log n)

O(n²)

O(n*n!)

O(infinity)

Question 8 of 10

Question 9 of 10

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

It can also be considered as comparison based sort

It is a non comparison based integer sort

It is a distribution sort

It is in place sorting algorithm

Question 9 of 10

Question 10 of 10

10. Which of the following is not necessarily a stable sorting algorithm?

pigeonhole sort

bucket sort

merge sort

counting sort

Question 10 of 10