A teacher stores student marks in a sorted array and must frequently search for specific marks. Which search method is most suitable and why?

Q: How do I try a free CIE Computer Science question?

Just tap any of the four options on this page — no signup, no card, nothing to install. You'll see the correct answer and a full mark-scheme-style explanation within a second. Each visit shows a fresh randomly-picked question from the live CIE IGCSE Computer Science bank, so you can keep refreshing to try different ones before deciding whether to create a free account for daily access.

Q: Is Kramizo really free for CIE Computer Science students?

Yes — completely free. Every student gets 45 questions a day on the free plan, across any board and any subject, with no card required and no trial countdown. Kramizo's optional Pro plan removes the daily cap and adds analytics, but the free plan is genuinely free forever. We make money from the small percentage of students who choose to upgrade — not from selling data or ads.

Q: Are the Computer Science questions aligned to the CIE IGCSE syllabus?

Every question is written against the published CIE IGCSE Computer Science syllabus and reviewed for accuracy before being added to the bank. We match the command words (state, describe, explain, evaluate), mark allocations, and difficulty tier you'll see on real CIE past papers. Explanations are written in the style of official examiner mark schemes so students learn exactly what marks are being awarded for.

Question

A teacher stores student marks in a sorted array and must frequently search for specific marks. Which search method is most suitable and why?

Accepted Answer

Binary search, because it is more efficient for repeated searches on sorted data — Since the data is already sorted, binary search can be applied and will require far fewer comparisons than linear search, especially if searches are performed frequently. This makes binary search the most efficient and suitable choice. Option A is incorrect because sorting does not speed up linear search. Option B is false — linear search uses the same worst-case comparisons regardless of order. Option C gives the right answer for the wrong reason; the phrasing implies binary search is chosen only by elimination.

Answer

Linear search, because sorted data makes linear search faster

Answer

Linear search, because it requires fewer comparisons on sorted data

Answer

Binary search, because it is more efficient for repeated searches on sorted data

Answer

Binary search, because it cannot be used on unsorted data anyway

One real Computer Science question.No signup. 30 seconds.

One real Computer Science question.
No signup. 30 seconds.