Boolean logic
10What the syllabus asks of you
- Identify and use the standard symbols for logic • See section 4 for logic gate symbols gates
- Define and understand the functions of logic • Including: gates – NOT – AND – OR – NAND – NOR – XOR (EOR) – the binary output produced from all the possible binary inputs • NOT is a single input gate • All other gates are limited to two inputs
- (a) Use logic gates to create given logic circuits • Circuits must be drawn for the statement given, from a: without simplification (i) problem statement • Logic circuits will be limited to a maximum of (ii) logic expression three inputs and one output (iii) truth table (b) Complete a truth table from a: • An example truth table with three inputs, for (i) problem statement completion: (ii) logic expression A B C Output (iii) logic circuit 0 0 0 0 0 1 0 1 0 0 1 1 1 0 0 1 0 1 1 1 0 1 1 1 (c) Write a logic expression from a: (i) problem statement (ii) logic circuit (iii) truth table
Read the notes first
Chapter 10: Boolean Logic
Drill this topic
All 24 questions on Boolean logic, untimed — answer on paper, then mark yourself against the mark scheme.
Make a worksheet
Choose the years and how many questions, then print it with the answers on separate pages.
24 questions
These are structured questions, answered in working rather than by picking an option, so they are not listed here one by one. The drill above puts each in front of you with its mark scheme to check against.

