Boolean logic

Worked examples (6)

• 1Complete a 2-input truth table (4 marks)
• 2Derive an expression from a circuit description (3 marks)
• 3Draw a circuit from a logic expression (4 marks)
• 4Write an expression from a problem statement (4 marks)
• 5Build a truth table for a 3-input expression (6 marks)
• 6Truth table mixing XOR and NAND (6 marks)

Model answers (6)

• ✓Model answer — 0478 Paper 2 — style
• ✓Model answer — 0478 Paper 2 — style
• ✓Model answer — 0478 Paper 2 — style
• ✓Model answer — 0478 Paper 2 — style
• ✓Model answer — 0478 Paper 2 — style
• ✓Model answer — 0478 Paper 2 — style

Worked examples (6)

• 1Complete a single-gate truth table — AND (2 marks)
• 2Complete a single-gate truth table — OR (2 marks)
• 3Complete truth tables for AND, OR and XOR (4 marks)
• 4NOT, NAND and NOR behaviour (4 marks)
• 5Identify a gate from its truth table (3 marks)
• 6XOR behaviour and the difference from OR (3 marks)

Model answers (6)

• ✓Model answer — 0478 Paper 2 — style
• ✓Model answer — 0478 Paper 2 — style
• ✓Model answer — 0478 Paper 2 — style
• ✓Model answer — 0478 Paper 2 — style
• ✓Model answer — 0478 Paper 2 — style
• ✓Model answer — 0478 Paper 2 — style