Data Structure II Mock Test 1

10%

Question 1 of 10

1. What is the value of jump taken for maximum efficiency while implementing jump search?

n/2

n²

log n

n^1/2

Question 1 of 10

Question 2 of 10

2. Consider an array of length 5, arr[5] = {9,7,4,2,1}. What are the steps of insertions done while running insertion sort on the array?

7 9 4 2 1 4 7 9 2 1 2 4 7 9 1 1 2 4 7 9

9 7 4 1 2 9 7 1 2 4 9 1 2 4 7 1 2 4 7 9

7 9 4 2 1 2 4 7 9 1 4 7 9 2 1 1 2 4 7 9

7 4 2 1 9 4 2 1 9 7 2 1 9 7 4 1 9 7 4 2

Question 2 of 10

Question 3 of 10

3. Which of the following is good for sorting arrays having less than 100 elements?

Quick Sort

Merge Sort

Insertion Sort

Selection Sort

Question 3 of 10

Question 4 of 10

4. Merge sort can be implemented using O(1) auxiliary space.

false

true

Question 4 of 10

Question 5 of 10

5. Find the pivot element from the given input using median-of-three partitioning method.
8, 1, 4, 9, 6, 3, 5, 2, 7, 0.

Question 5 of 10

Question 6 of 10

6. Which of the following stable sorting algorithm takes the least time when applied to an almost sorted array?

Selection sort

Merge sort

Quick sort

Insertion sort

Question 6 of 10

Question 7 of 10

7. What is the best case for linear search?

O(nlogn)

O(n)

O(1)

O(logn)

Question 7 of 10

Question 8 of 10

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

O(n log n²)

O(n log n)

O(n²)

O(n² log n)

Question 8 of 10

Question 9 of 10

9. Merge sort uses which of the following algorithm to implement sorting?

backtracking

divide and conquer

dynamic programming

greedy algorithm

Question 9 of 10

Question 10 of 10

10. Which of the following is not an application of binary search?

Debugging

To search in unordered list

To find the lower/upper bound in an ordered sequence

Union of intervals

Question 10 of 10