Binary Search MCQ Practice

Question 1 of 10

Sorted [3,6,9,12,15]. Search 3; first middle 9. Still possible?

  1. A. 3 only
  2. B. 12, 15
  3. C. 3, 6
  4. D. 9, 12, 15

Question 2 of 10

Which situation correctly blocks binary search?

  1. A. Sorted negative numbers
  2. B. Sorted list of 2 elements
  3. C. Sorted list with duplicates
  4. D. Unsorted exam scores

Question 3 of 10

Sorted [5,10,15,20,25,30,35]. Search 35; first middle index 4 (value 20). How many remain possible?

  1. A. 3
  2. B. 4
  3. C. 1
  4. D. 2

Question 4 of 10

After one comparison, half is eliminated. What justifies which half to keep?

  1. A. A coin flip
  2. B. Ordering between target and compared element
  3. C. LENGTH of a second unsorted list
  4. D. Whether the target is even

Question 5 of 10

Alphabetical sorted ["be","go","me","to","we"]. Search "be"; first middle "me". Remaining?

  1. A. "to", "we"
  2. B. All five words
  3. C. "be", "go"
  4. D. "me", "to", "we"

Question 6 of 10

Binary search repeatedly:

  1. A. Shuffles before each comparison.
  2. B. Compares only first and last forever.
  3. C. Appends the target.
  4. D. Starts near the middle of the current sorted range and discards about half the remaining elements.

Question 7 of 10

Sorted [1,2,3,4,5,6]. Target 4; first middle index 3 (value 3). Remaining?

  1. A. 4, 5, 6
  2. B. 3, 4, 5, 6
  3. C. 4 only
  4. D. 1, 2, 3

Question 8 of 10

Unsorted [7,1,9] seeking 9: student compares middle 1, discards left because 9 > 1, keeping [9], and claims this always works. Best critique?

  1. A. It always works on any list.
  2. B. It happened to keep 9 here, but the same discard rule can fail on other unsorted arrangements.
  3. C. Binary search forbids finding the target on the first hit.
  4. D. 9 cannot appear with 1.

Question 9 of 10

Sorted [11,22,33,44]. Show 10 absent: first compare index 2 (22), then remaining left element 11. Comparisons used?

  1. A. 4
  2. B. 1
  3. C. 2
  4. D. 3

Question 10 of 10

Which is true?

  1. A. Binary search always uses more comparisons than linear search.
  2. B. Binary search requires robot commands.
  3. C. Binary search works on short unsorted lists.
  4. D. Data must be in sorted order to use binary search.