Top MCQs on Binary Search Algorithm with Answers (original) (raw)

What is the worst case time complexity of insertion sort where position of the data to be inserted is calculated using binary search?

Given an array arr = {12, 13, 35, 78, 56} and key = 78; How many iterations are done until the element is found using Binary search?

Select the best description to explain what a binary search algorithm is.

Put the elements in order, check each item in turn.
Elements do not need to be in order, compare to the middle value, split the list in order and repeat
Elements do not need to be in order, check each item in turn.
Put the elements in order, compare with the middle value, split the list in order and repeat.

What is the best-case TIme complexity of Binary search to find an element?

A binary search is to be performed on the list:
3 5 7 10 23
How many comparisons would it take to find number 7?

What are the mid values (corresponding array items) produced in the first and second iterations for an array arr = [23, 45, 67, 89, 90,46 ]and key = 90?

Identify what the below function is doing.

C++ `

int fun(int arr[], int size, int key, int k) { int s = 0; int e = size - 1; int mid = s + (e - s) / 2; int ans = -1; while (s <= e) { if (arr[mid] == key) { if (arr[mid - k] == arr[mid]) e = mid - 1; else if (arr[mid - (k - 1)] == arr[mid]) { ans = mid; break; } else { s = mid + 1; } } else if (key < arr[mid]) { e = mid - 1; } else if (key > arr[mid]) { s = mid + 1; } mid = s + (e - s) / 2; } return ans; }

Finding Kth occurrence of the element in O(N)
Finding the kth occurrence of the element in O(logN)

Which of the following is correct recurrence for worst case of Binary Search?

T(n) = 2T(n/2) + O(1) and T(1) = T(0) = O(1)
T(n) = T(n-1) + O(1) and T(1) = T(0) = O(1)
T(n) = T(n/2) + O(1) and T(1) = T(0) = O(1)
T(n) = T(n-2) + O(1) and T(1) = T(0) = O(1)

Consider the following C program that attempts to locate an element x in an array Y[] using binary search. The program is erroneous.

C `

f(int Y[10], int x) {
```
int i, j, k;
```
```
i = 0; j = 9;
```
```
do {
```
```
        k =  (i + j) /2;
```

        if( Y[k] < x)  i = k; else j = k;

```
    } while(Y[k] != x && i < j);
```

if(Y[k] == x) printf ("x is in the array ") ;

else printf (" x is not in the array ") ;

}

On which of the following contents of Y and x does the program fail?

Y is [2 4 6 8 10 12 14 16 18 20] and 2 < x < 20 and x is even
Y is [2 2 2 2 2 2 2 2 2 2] and x > 2
Y is [1 3 5 7 9 11 13 15 17 19] and x < 1
Y is [1 2 3 4 5 6 7 8 9 10] and x < 10

The time taken by binary search algorithm to search a key in a sorted array of n elements is

There are 11 questions to complete.

Take a part in the ongoing discussion