This topic summary covers Knowledge Organiser: Boolean Expressions within Boolean Expressions for GCSE Computer Science. Revise Boolean Expressions in 3.4 Computer Systems for GCSE Computer Science with 17 exam-style questions and 22 flashcards. This topic appears regularly enough that it should still be part of a steady revision cycle. It is section 12 of 12 in this topic. Use this topic summary to connect the idea to the wider topic before moving on to questions and flashcards.
Knowledge Organiser: Boolean Expressions
Key Terms
- Boolean expression: A written representation of a logic circuit using AND, OR, NOT and brackets
- Boolean algebra: The mathematical system for working with true/false (1/0) values
- Operand: A variable (A, B, C) in a Boolean expression
- Double negation: NOT(NOT(A)) = A — two NOTs cancel each other out
- De Morgan's Law: NOT(A AND B) = NOT(A) OR NOT(B); NOT(A OR B) = NOT(A) AND NOT(B)
Must-Know Facts
- Order of operations: Brackets → NOT → AND → OR (just like BIDMAS)
- NOT(A AND B) is NOT the same as NOT(A) AND NOT(B) — De Morgan's Law applies
- GCSE accepts word form (AND/OR/NOT) or symbols (∧/∨/¬) — be consistent
- Always use brackets to make the intended order of operations clear
- Translation: "both/all" → AND; "either/at least one" → OR; "not/opposite" → NOT
- Double negation: NOT(NOT(A)) simplifies to A
Key Concepts
- Evaluating NOT(A) AND (B OR C) with A=1, B=0, C=1: Step 1 NOT(1)=0; Step 2 0 OR 1=1; Step 3 0 AND 1=0
- Writing from a circuit: identify each gate left to right, wrap in brackets for each stage
- A AND NOT(A) = 0 (contradiction); A OR NOT(A) = 1 (tautology)
- Show ALL intermediate steps when evaluating — method marks awarded for each step
Common Mistakes
- Ignoring order of operations: NOT must be evaluated before AND, and AND before OR — failing to follow Brackets → NOT → AND → OR leads to incorrect results in multi-operator expressions
- Misapplying De Morgan's Law: NOT(A AND B) = NOT(A) OR NOT(B) — students often forget to flip AND to OR (or OR to AND) when distributing the NOT; both the operator AND the NOT on each variable must change
- Not showing intermediate steps: Exam mark schemes award method marks for each evaluation step — writing only the final answer risks losing all marks if it is wrong
- Writing expressions without brackets for NOT: NOT A AND B is ambiguous — write NOT(A) AND B to make it clear that only A is negated, not the whole expression
Practice questions for Boolean Expressions
Which Boolean operator produces an output of 1 only when BOTH inputs are 1?
State De Morgan's first law and give an example to illustrate it.