Six original Cambridge-style questions on completing truth tables for two and three inputs, with every row worked out.
Complete the truth table for X = (A OR B) AND NOT C, for the inputs 000 to 111 in binary order.
A logic circuit has a NAND gate with inputs A and B. Its output and input C go into an XOR gate, whose output is X. Complete the truth table for X.
A machine M starts (M = 1) when the safety guard is closed (G = 1) and either start button P or start button Q is pressed (= 1). (a) Write the logic expression. (b) Complete the truth table for inputs G, P, Q.
Explain why a truth table for a circuit with three inputs has eight rows, and why the rows are written in binary counting order.
A student completes the truth table for X = A AND NOT B and writes X = 0, 1, 0, 0 for the rows A B = 00, 01, 10, 11. Identify the error and give the correct output column.
Complete the truth table for X = (A AND B) OR (B AND C). Use working columns.
Mark this once you have attempted all six and checked your working. It records a Practiced badge on the topic and adds a one-time bonus. Revealing the solutions alone does not count.