Data Structure II Mock Test 2

10%

Question 1 of 10

1. Which of the following sorting algorithm is a constituent of tim sort?

merge sort

heap sort

quick sort

selection sort

Question 1 of 10

Question 2 of 10

2. Records R1, R2, R3,.. RN with keys K1, K2, K3,.. KN are said to be h-ordered, if ________

Ki <= Ki+h for 1<= i <= N-h

Ki <= Ki+h for 1<= i*h <= N

Ki <= Kh for 1<= i <= h

Kh <= Ki+h for 1<= i <= N

Question 2 of 10

Question 3 of 10

3. Statement 1: Shell sort is a stable sorting algorithm.
Statement 2: Shell sort is an in-place sorting algorithm.

Statement 2 is true but statement 1 is false

Both statements are false

Statement 2 is false but statement 1 is true

Both statements are true

Question 3 of 10

Question 4 of 10

4. Randomized quick sort is a stable sort.

false

true

Question 4 of 10

Question 5 of 10

5. What is the usual size of a run in tim sort?

less than 32

32-64 depending on size of the array

Question 5 of 10

Question 6 of 10

6. What is the worst case time complexity of comb sort?

O(n)

O(n log n)

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

O(n²)

Question 6 of 10

Question 7 of 10

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

O(1)

O(n)

O(n²)

O(n log n)

Question 7 of 10

Question 8 of 10

8. Which of the following sorting algorithm is not in-place?

insertion sort

intro sort

tim sort

quick sort

Question 8 of 10

Question 9 of 10

9. What is the auxiliary space complexity of a median of three quick sort?

O(log n)

O(1)

O(n log n)

O(n)

Question 9 of 10

Question 10 of 10

10. Which of the following algorithm is stable?

quick sort

cube sort

bogosort

heap sort

Question 10 of 10