GCSE Revision Aid: This resource is designed to support your revision and may contain errors. If you find a discrepancy with your class teaching, your teacher is correct — please let us know at gcserevise@scott.scottrix.co.uk.

E6: Logic Gates

WJEC Eduqas C690QS

AND, OR, NOT, NAND, NOR, XOR gates and truth tables

Fastmail

Logic Gates

AND, OR, NOT, NAND, NOR, XOR gates and truth tables

Key Fact: An AND gate outputs 1 only when ALL inputs are 1; its truth table has one high output for two inputs.
Key Fact: An OR gate outputs 1 when ANY input is 1; it produces a low output only when all inputs are 0.
Key Fact: A NOT gate (inverter) outputs the complement of its single input: 0 becomes 1 and 1 becomes 0.
Key Fact: A NAND gate is the complement of AND: output is 0 only when all inputs are 1; it is a universal gate.
Key Fact: A NOR gate is the complement of OR: output is 1 only when all inputs are 0; also a universal gate.
Key Fact: An XOR (exclusive OR) gate outputs 1 when inputs are different; XNOR outputs 1 when inputs are the same.
Key Fact: NAND and NOR are universal gates: any Boolean function can be implemented using only NAND or only NOR gates.
Key Fact: Logic 1 typically corresponds to a high voltage (e.g. 5 V); logic 0 to a low voltage (e.g. 0 V).
Key Fact: Truth tables list all possible input combinations and the corresponding output for each.
Key Fact: For n inputs, a truth table has 2ⁿ rows covering every input combination.
Key Fact: Logic gates are built from transistors; CMOS technology uses complementary pairs of MOSFETs.
Key Fact: Propagation delay is the time between a change at the input and the corresponding change at the output.

📋 Key Vocabulary and Concepts

For Logic Gates, you must know:

❓ Practice Questions

Q: Draw the truth table for a 2-input AND gate.

Q: What is the output of a NAND gate when both inputs are 1?

Q: Why are NAND and NOR called universal gates?

Q: How many rows does a truth table for a 3-input logic gate have?

Q: What is the difference between XOR and XNOR gates?

✅ Answers

  1. A=0,B=0→0; A=0,B=1→0; A=1,B=0→0; A=1,B=1→1.
  2. 0. A NAND gate produces the complement of the AND output.
  3. Because any Boolean function can be implemented using only NAND gates or only NOR gates, without needing any other gate type.
  4. 2³ = 8 rows.
  5. XOR outputs 1 when inputs are different; XNOR outputs 1 when inputs are the same (XOR followed by NOT).

🎯 Exam Tips

📝 Exam Technique

GCSE Electronics Exam Tips — Logic Gates:
1. For Logic Gates questions, use correct electronic symbols and terminology
2. Always show your working in calculations, including units at each step
3. When analysing circuits, state which law or rule you are applying first
4. For evaluation questions on Logic Gates, compare component choices and consider cost, reliability and tolerance
5. Draw circuit diagrams neatly with conventional symbols

⚠️ Common Errors

✗ Confusing OR and XOR truth tables. ✓ OR outputs 1 when any input is 1; XOR outputs 1 only when inputs differ (0,1 or 1,0).

✗ Forgetting the bubble (inversion) on NAND and NOR gate symbols. ✓ NAND has a bubble on the output of an AND symbol; NOR has a bubble on the output of an OR symbol.

✗ Omitting rows from a truth table. ✓ A complete truth table for n inputs must have 2ⁿ rows covering all combinations.

✗ Stating that AND and OR are universal gates. ✓ Only NAND and NOR are universal gates; AND and OR cannot implement inversion alone.

✍️ Model Answer

Full-Mark Response

Describe the function of each fundamental logic gate (AND, OR, NOT, NAND, NOR, XOR) and explain why NAND is a universal gate.

An AND gate outputs 1 only when all inputs are 1. An OR gate outputs 1 when any input is 1. A NOT gate inverts its single input. A NAND gate outputs 0 only when all inputs are 1 (complement of AND). A NOR gate outputs 1 only when all inputs are 0 (complement of OR). An XOR gate outputs 1 when its inputs are different. NAND is a universal gate because any Boolean function can be built using only NAND gates: a NOT gate is a NAND with both inputs tied together; an AND gate is a NAND followed by a NOT (two NANDs); an OR gate is implemented by inverting both inputs first then feeding them to a NAND (De Morgan's equivalence). Since NOT, AND and OR together can implement any Boolean expression, and all three can be built from NAND alone, NAND is universal. The same reasoning applies to NOR.

📊 AO Deep Dive

Assessment Objective Analysis

AO1 (Knowledge & Understanding): Demonstrate knowledge and understanding of logic gates, including electronic components, circuit theory and systems concepts relevant to WJEC Eduqas C690QS.

AO2 (Application): Apply knowledge and understanding of logic gates to analyse, design and construct electronic circuits and systems.

AO3 (Evaluation): Evaluate electronic circuits and systems, making reasoned judgements about design choices, performance and practical considerations, constructing supported arguments.

📝 Exam Questions by Topic

🎬 Video Resources

Share this page

Ready to ace your GCSE Electronics exams?

Get the best revision books and guides to boost your grades.