Data Structure II Mock Test 2

10%

Question 1 of 10

1. What is the average time complexity of Tim sort?

O(n²)

O(log n)

O(n log n)

O(n)

Question 1 of 10

Question 2 of 10

2. Strand sort is a stable sorting algorithm.

true

false

Question 2 of 10

Question 3 of 10

3. What is the best case time complexity of comb sort and bubble sort respectively?

O(n log n) and O(n)

O(n²/2^a) (a=number of increment) and O(n²)

O(n) and O(n²)

O(n²) and O(n log n)

Question 3 of 10

Question 4 of 10

4. Tim sort is a comparison based sort.

true

false

Question 4 of 10

Question 5 of 10

5. What is the other name for a shell sort algorithm?

Diminishing decrement sort

Diminishing increment sort

Selection sort

Insertion sort

Question 5 of 10

Question 6 of 10

6. Auxiliary space requirement of cocktail sort is _____________

O(n)

O(1)

O(log n)

O(n²)

Question 6 of 10

Question 7 of 10

7. What is the worst case time complexity of cycle sort?

O(log n)

O(n²)

O(n)

O(n log n)

Question 7 of 10

Question 8 of 10

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

O(n log n)

O(n)

O(log n)

O(n²)

Question 8 of 10

Question 9 of 10

9. Tim sort begins sorting the given array by using which of the following sorting algorithm?

quick sort

insertion sort

selection sort

merge sort

Question 9 of 10

Question 10 of 10

10. Which one of the following sorting algorithm is best suited to sort an array of 1 million elements?

Bubble sort

Insertion sort

Merge sort

Quick sort

Question 10 of 10