Gce Model Questions Vol1 2022 Computer Studies Question 5
Practice objective / multiple choice question 5 from the 2022 Gce Model Questions Vol1 Computer Studies examination.
A binary‑search routine first compares the target value with the middle element of a sorted list, then discards the half that cannot contain the target and repeats the process. After the loop terminates, the algorithm performs one additional comparison to confirm that the target is absent. For a sorted list containing \(1024\) distinct numbers, what is the maximum number of element comparisons performed when searching for a value that is not present?
Answer Options
About This Question
This is Gce Model Questions Vol1 2022 Computer Studies Question 5. It is one of the objective questions from the 2022 Gce Model Questions Vol1 Computer Studies examination.
Difficulty level: Medium .
Master the Exam!
You've seen a preview, but there are thousands more questions plus AI tutor to break down complex solutions.