Kramizo
Log inSign up free
Home › CIE IGCSE Computer Science › Algorithm design and problem-solving: searching algorithms (linear search, binary search)
CIE · IGCSE · Computer Science

Algorithm design and problem-solving: searching algorithms (linear search, binary search)
Practice Questions

20 CIE IGCSE Computer Science questions on Algorithm design and problem-solving: searching algorithms (linear search, binary search), each with instant feedback and a full examiner-style mark scheme.

⚡ Start Quiz on Algorithm design and problem-solving: searching algorithms (linear search, binary search) →📖 Read Revision NotesTry one question
✨ Revision guide includes key terms, worked examples and exam technique for Algorithm design and problem-solving: searching algorithms (linear search, binary search).

Try 2 sample questions on Algorithm design and problem-solving: searching algorithms (linear search, binary search)

Question 1 · 1 mark · Difficulty 1/3

A linear search is performed on an unsorted list of 10 items. What is the maximum number of comparisons needed to find an item or confirm it is absent?

  1. 10 comparisons
  2. 9 comparisons
  3. 5 comparisons
  4. 4 comparisons
Show answer & explanation
✓ Answer: A — 10 comparisons
In a linear search, every element is checked one by one. In the worst case (item not present or at the last position), all 10 elements are compared, giving 10 comparisons. Option B (9) is wrong because the final element must also be checked. Option A confuses this with average case. Option D has no basis in the algorithm.
Question 2 · 1 mark · Difficulty 2/3

A sorted list contains the values: 3, 7, 12, 18, 25, 31, 40. A binary search is used to find the value 18. Which element is examined first?

  1. The value 12 at index 3
  2. The value 25 at index 5
  3. The value 3 at index 1
  4. The value 18 at index 4
Show answer & explanation
✓ Answer: D — The value 18 at index 4
The list has 7 elements (indices 1–7). The midpoint is calculated as (1+7)÷2 = 4, so the element at index 4, which is 18, is examined first. Option A is wrong because linear search, not binary search, starts at the first element. Option B is at index 5, not the midpoint. Option D is at index 3, which would only be the midpoint of a 5-element list.
⚡ Start a Quiz on Algorithm design and problem-solving: searching algorithms (linear search, binary search) →
20 questions · 25 min · free

CIE IGCSE Computer Science: Algorithm design and problem-solving: searching algorithms (linear search, binary search) FAQ

How many CIE IGCSE Computer Science questions on Algorithm design and problem-solving: searching algorithms (linear search, binary search) are there on Kramizo?
Kramizo currently has 20 exam-board-aligned practice questions on Algorithm design and problem-solving: searching algorithms (linear search, binary search) for CIE IGCSE Computer Science, with new questions added every week. Each question gives you instant feedback and a full examiner-style mark scheme that tells you exactly what would earn marks on a real CIE paper. The questions span the full difficulty range — from straightforward recall (level 1) right up to multi-step reasoning and evaluation (level 3) — so the bank works for first-pass revision and final exam-week stress testing alike.
Is Kramizo free for CIE IGCSE students preparing for Computer Science?
Yes — completely free. Every student gets 45 questions a day on the free plan, with no card required and no trial countdown. That free quota works across every subject and every topic in our bank, so you can mix Algorithm design and problem-solving: searching algorithms (linear search, binary search) practice with other Computer Science topics or even switch to a totally different CIE subject without paying anything. Kramizo's optional Pro plan removes the daily cap and adds detailed progress analytics, but the free tier is the real product — used by thousands of GCSE, IGCSE and CSEC students.
Are the Algorithm design and problem-solving: searching algorithms (linear search, binary search) questions aligned to the official CIE IGCSE Computer Science syllabus?
Every question is written against the published CIE IGCSE Computer Science specification, including the exact command words (state, describe, explain, calculate, evaluate, etc.), mark allocations, and difficulty tier you'd see on a real CIE paper. Explanations are written in the style of official examiner mark schemes — they tell you what is being awarded marks and why distractors are wrong, not just whether you got it right. The bank is continually refined to match the latest syllabus updates from CIE.
How is Algorithm design and problem-solving: searching algorithms (linear search, binary search) typically tested on CIE IGCSE Computer Science papers?
Algorithm design and problem-solving: searching algorithms (linear search, binary search) appears across multiple question types on real CIE IGCSE Computer Science papers — most commonly as multiple-choice questions in the objective section, structured short-answer questions in the main paper, and occasionally as part of an extended response. Kramizo's practice bank reflects that mix: 4-option MCQs, true/false statements, fill-in-the-blank key terms, multi-select questions, and ordering questions. Working through the bank gives you exposure to every question style examiners actually use.

Lock in Algorithm design and problem-solving: searching algorithms (linear search, binary search) before exam day.

Start practising in 30 seconds — no card required.

⚡ Start Quiz Free →