Searching Algorithms: Binary Search for Competitive Exams

Searching Algorithms: Binary Search - Typical Problems - Case Studies

Q. If a binary search is performed on an array of 32 elements, how many iterations will it take in the worst case?

Solution

The worst-case number of iterations is log2(32) = 5.

Correct Answer: C — 6

Q. What happens if the array is not sorted before performing a binary search?

Solution

If the array is not sorted, binary search will give incorrect results because it relies on the order of elements.

Correct Answer: B — It will give incorrect results

Q. What is the worst-case number of comparisons in binary search for an array of size 16?

Solution

The worst-case number of comparisons is log2(16) = 4, but since we start counting from 0, it takes 5 comparisons.

Correct Answer: C — 6

Q. What will be the result of a binary search for the value 10 in the array [1, 2, 3, 4, 5, 6, 7, 8, 9]?

Solution

The value 10 is not present in the array, so the result will be 'Not Found'.

Correct Answer: B — Not Found

Showing 1 to 4 of 4 (1 Pages)