How to Solve Boolean Logic and Logic Circuit Questions in IGCSE Computer Science (0478)

Boolean logic in Cambridge IGCSE Computer Science (0478) is less about memorising six gate symbols and more about moving accurately between four forms of the same idea: a problem statement, a logic expression, a logic circuit and a truth table. Under the current 2026-2028 syllabus, candidates need to work with NOT, AND, OR, NAND, NOR and XOR gates, create circuits from statements, expressions or truth tables, complete truth tables from statements, expressions or circuits, and write logic expressions from the same kinds of information. Cambridge limits these circuits to a maximum of three inputs and one output, which means the questions are manageable if you work in a fixed sequence instead of trying to see the whole answer at once.

Know exactly what each gate does

Start with the behaviour of the gates, not their shapes. AND gives an output of 1 only when both inputs are 1. OR gives 1 when at least one input is 1. NOT reverses a single input. NAND is the opposite of AND. NOR is the opposite of OR. XOR gives 1 when the two inputs are different. The current syllabus limits NOT to one input and the other gates to two inputs. The useful habit is to think in conditions. AND means both conditions must be true. OR means one or both may be true. XOR means exactly one of the two is true. NAND means it is not the case that both are true. NOR means neither condition is true. Once those sentences are automatic, truth tables and circuit questions become much less mechanical.

Do not confuse OR with XOR

OR and XOR are the easiest gates to mix up. If A = 1 and B = 1, OR outputs 1 because at least one input is 1. XOR outputs 0 because the inputs are the same. A quick check is to ask what happens when both inputs are 1. If the output must still be 1, you need OR. If it must become 0, you need XOR. This difference matters in word problems. A statement such as 'the alarm sounds if the front sensor or the back sensor is active' normally includes the case where both sensors are active, so OR fits. A statement such as 'the indicator turns on when exactly one of the two switches is active' points to XOR.

Translate a problem statement one condition at a time

When a question gives you a real-world statement, do not jump straight to drawing gates. Rewrite the statement as smaller logical conditions first. Suppose a security light turns on when it is dark AND motion is detected. Let D represent darkness and M represent motion. The output can be written as D AND M. If the light should also turn on when an emergency switch E is active, the full expression becomes (D AND M) OR E. Brackets matter because they show which operation happens first. In the example above, D and M must be combined before the result is ORed with E. If you drew D AND (M OR E), you would be representing a different rule. The safest method is to identify the smallest pair of inputs that are combined first, then treat their result as a new intermediate value.

Build a logic circuit from the inside out

For an expression such as (A AND B) OR NOT C, start with the operations inside the expression. A and B enter an AND gate. C enters a NOT gate. The two outputs then enter an OR gate. This gives you a clean circuit without guessing. Cambridge states that circuits should be drawn for the statement given without simplification. That means you should represent the stated logic rather than trying to use Boolean algebra to create an equivalent but shorter circuit. If the statement says NOT, AND and OR in a particular structure, draw that structure.

Use intermediate columns when completing truth tables

Truth tables become easier when you create intermediate results rather than trying to calculate the final output in your head. For (A AND B) OR NOT C, you can first work out A AND B for every row, then NOT C, then combine those two columns with OR. Even if the exam table only provides space for the final output, doing the intermediate work in your rough space reduces mistakes. For three inputs, there are eight possible input combinations. A reliable order is 000, 001, 010, 011, 100, 101, 110, 111. Do not skip a row or duplicate a combination. If the question already supplies the input columns, follow the order exactly and calculate the output row by row.

Read a circuit from left to right

When the question gives you a circuit and asks for a truth table or expression, work from the inputs toward the output. Label the output of each gate mentally or on the diagram. If A and B first enter an OR gate, call that intermediate result X. If X and C then enter a NAND gate, the final output is X NAND C. Replacing X gives the full expression: (A OR B) NAND C. This prevents you from overlooking a gate or applying the final operation to the wrong inputs. It is especially useful when NOT gates appear on an input or on an intermediate output.

Write logic expressions as expressions, not equations

If the question asks for a logic expression, write the expression itself. A Cambridge examiner report from June 2024 notes a common mistake where candidates added 'X =' at the beginning of an otherwise correct logic expression. Unless the question specifically asks you to define or assign an output variable, do not add extra notation that was not requested. Keep the operators and brackets visible. A clear expression such as (A OR B) AND NOT C is safer than writing a compressed form that makes the order ambiguous. Match the terminology used in the syllabus and question.

Work backwards from a truth table by looking for the 1s

When you are given a truth table and asked to identify a gate or construct a circuit, look at the output pattern. For two inputs, a single 1 only at A = 1, B = 1 suggests AND. A single 0 only at A = 1, B = 1 suggests NAND. A single 1 only at A = 0, B = 0 suggests NOR. Outputs of 1 when the inputs differ suggest XOR. For a three-input table, the pattern may represent a combination of gates rather than one gate. Choose the simplest relationship you can clearly justify from the rows, then check every row against your proposed expression. One matching row proves nothing; the expression must reproduce the complete output column.

Original worked example: statement to expression, circuit and truth table

Imagine a cooling fan that turns on when the temperature sensor T is active AND either the manual switch M is active OR the override sensor O is active. Start by translating the condition: T AND (M OR O). The brackets show that M and O are combined first. In the circuit, M and O therefore enter an OR gate, and that output enters an AND gate with T. Now test the logic before completing the whole truth table. If T = 0, the final output must be 0 regardless of M and O because the final gate is AND. If T = 1, the output depends on M OR O. Therefore the output is 1 for 101, 110 and 111 when the inputs are ordered T, M, O, and 0 for the remaining combinations. Checking the structure in words first makes the final table much faster to complete.

Original worked example: circuit to expression

Suppose inputs A and B enter a NAND gate, and that result is then ORed with NOT C. Work stage by stage. The first result is A NAND B. The second result is NOT C. The final expression is (A NAND B) OR NOT C. Do not try to simplify the NAND into a different Boolean form unless the question asks you to do that. The current syllabus specifically expects circuits to represent the given statement without simplification.

Common Boolean logic mistakes

1. Treating OR as 'exactly one input is 1' instead of 'one or both inputs are 1'.
2. Forgetting that XOR outputs 0 when both inputs are 1.
3. Losing the brackets and therefore changing the order of operations.
4. Trying to calculate the final truth-table output in one step instead of using intermediate values.
5. Skipping or duplicating one of the eight combinations in a three-input truth table.
6. Reading a circuit from the output backwards and attaching gates to the wrong inputs.
7. Simplifying a circuit when the task is to draw the circuit for the statement as given.
8. Adding unnecessary notation such as 'X =' when the question only asks for a logic expression.

A quick method for exam questions

1. Identify the inputs and the single output.
2. Translate each word or symbol into a gate operation.
3. Use brackets to show which operation happens first.
4. If drawing a circuit, build the innermost operation first and work outward.
5. If completing a truth table, calculate intermediate results before the final output.
6. If reading a circuit, label the output of each gate before moving to the next.
7. If starting from a truth table, test your proposed logic against every row, not just one or two.
8. Before finishing, check OR versus XOR, NAND versus AND, and NOR versus OR.

Practise conversions, not isolated gate definitions

Knowing the six gate definitions is necessary, but it is not enough. The current syllabus explicitly requires conversion between problem statements, expressions, circuits and truth tables in several directions. A useful revision session therefore takes one logic rule and represents it in all four forms. Write the statement, turn it into an expression, draw the circuit and complete the truth table. Then start from the truth table and see whether you can reconstruct the same logic. This exposes mistakes much faster than memorising gate symbols separately. If your expression is correct but the truth table is wrong, the problem is probably evaluation. If the truth table is correct but the circuit is wrong, the issue is translation or gate placement.

Put it into practice

Choose one three-input Boolean logic question and solve it without looking at the mark scheme. Write the expression first, then build the circuit or truth table one stage at a time. After you finish, verify every row rather than checking only the final answer. Inside NeuraGeek, Boolean logic appears as its own Computer Science (0478) syllabus area, so you can use focused practice on that topic instead of waiting until a full Paper 2 attempt exposes the same mistake again.