Binary Search FRQ Practice

Responses receive AI feedback against a rubric after submission. Scores are practice estimates.

Question 1 of 5

Sorted temps [60,62,64,66,68,70,72]. Search 70; first middle index 4 (value 66). (a) Values still possible? (b) Why those remain? (c) Why must the list be sorted for this reasoning?

Question 2 of 5

U=[5,1,9,3] unsorted; S=[1,3,5,9] sorted. (a) Which is appropriate for binary search? (b) Requirement U fails? (c) One risk of half-elimination on U seeking 9?

Question 3 of 5

Sorted ids [100,200,300,400,500]. Search 100; first middle index 3 (value 300). (a) How many elements remain possible? (b) Name them. (c) Lower bound on comparisons still needed in the remaining range?

Question 4 of 5

Sorted codes [4,8,15,16,23,42]. (a) Search 16; first middle index 3 (value 15). Remaining? (b) If first middle were index 4 (value 16)? (c) Why binary search can use fewer comparisons than left-to-right scan?

Question 5 of 5

Catalog table:

Catalog Length Sorted?
A 1000 yes
B 50 no
C 50 yes

(a) Valid for binary search? (b) Between A and C, which likely needs more worst-case comparisons? Why? (c) Why B's length alone does not approve binary search?