Kramizo
Log inSign up free
Home › CIE IGCSE Computer Science › Boolean algebra and simplification of logic expressions
CIE · IGCSE · Computer Science

Boolean algebra and simplification of logic expressions
Practice Questions

20 CIE IGCSE Computer Science questions on Boolean algebra and simplification of logic expressions, each with instant feedback and a full examiner-style mark scheme.

⚡ Start Quiz on Boolean algebra and simplification of logic expressions →📖 Read Revision NotesTry one question
✨ Revision guide includes key terms, worked examples and exam technique for Boolean algebra and simplification of logic expressions.

Try 2 sample questions on Boolean algebra and simplification of logic expressions

Question 1 · 1 mark · Difficulty 1/3

Which row in the truth table for the expression A AND B is correct?

  1. A=0, B=1 gives output 1
  2. A=1, B=1 gives output 1
  3. A=0, B=0 gives output 1
  4. A=1, B=0 gives output 1
Show answer & explanation
✓ Answer: B — A=1, B=1 gives output 1
The AND gate outputs 1 only when ALL inputs are 1. A=1 and B=1 is the only combination that satisfies this. Options A, C, and D all include at least one 0 input, which causes the AND output to be 0.
Question 2 · 1 mark · Difficulty 1/3

Which Boolean expression correctly represents the output of a NOT gate whose input is A?

  1. A OR NOT A equals 0
  2. A + 0 gives the complement
  3. A' (A with a bar or prime notation)
  4. A AND NOT A equals 1
Show answer & explanation
✓ Answer: C — A' (A with a bar or prime notation)
The NOT gate inverts its input, so the output is written as A' or Ā. Option B describes a law, not a gate output. Option C is incorrect because A AND NOT A equals 0 (contradiction law). Option D is incorrect because A OR NOT A equals 1 (tautology law).
⚡ Start a Quiz on Boolean algebra and simplification of logic expressions →
20 questions · 25 min · free

CIE IGCSE Computer Science: Boolean algebra and simplification of logic expressions FAQ

How many CIE IGCSE Computer Science questions on Boolean algebra and simplification of logic expressions are there on Kramizo?
Kramizo currently has 20 exam-board-aligned practice questions on Boolean algebra and simplification of logic expressions 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 Boolean algebra and simplification of logic expressions 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 Boolean algebra and simplification of logic expressions 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 Boolean algebra and simplification of logic expressions typically tested on CIE IGCSE Computer Science papers?
Boolean algebra and simplification of logic expressions 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 Boolean algebra and simplification of logic expressions before exam day.

Start practising in 30 seconds — no card required.

⚡ Start Quiz Free →