Gce Model Questions Vol1 2023 Computer Studies Question 33
Practice objective / multiple choice question 33 from the 2023 Gce Model Questions Vol1 Computer Studies examination.
A program stores 10,000 records. Two search strategies are considered:\n\n1. Linear search on an unsorted array (each comparison costs 1 µs).\n2. Binary search on a sorted array (each comparison costs 1 µs) but the array must first be sorted using a comparison‑based algorithm where each comparison costs 10 µs.\n\nAssuming the sorting algorithm performs \(n\log_{2}n\) comparisons, after how many searches will the total time spent using strategy 2 become less than the total time using strategy 1? Give the smallest integer number of searches required.
Answer Options
About This Question
This is Gce Model Questions Vol1 2023 Computer Studies Question 33. It is one of the objective questions from the 2023 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.