# Mixed Practice: Boolean Logic

- **Track:** Cambridge IGCSE™ Computer Science (0478 / 0984) (CAMBRIDGE IGCSE 0478)
- **Module:** Section 10: Boolean Logic & Gate Circuits
- **Estimated Duration:** 20 minutes
- **Access:** Open Theory (All-Access for Interactive IDE & Autotests)

---

## Theory & Conceptual Background

Close your notes and try the mixed questions. Write calculations or a diagram on paper where useful. If you miss an item, explain the misconception and revisit its lesson before trying again.

## Delayed review

Return to these questions after studying another module, rather than only repeating them immediately. Change a value or a condition and predict how the answer changes. Explain one answer aloud without relying on a memorised keyword.

## Written transfer

Choose a practical example from this module and explain the mechanism, one benefit and one limitation. Check that each point refers to the example. Structured automatic checks cannot judge the quality of this explanation; use the lesson's worked examples and a teacher's feedback for that.

---

## Interactive Exercises & Autotest Specifications

### Exercise 1: Cumulative Check: Apply earlier ideas (Fill in blank, 30 XP)

**Instructions:**
Work out each answer before submitting. XOR(1,1): NAND(1,1): NOR(0,0): For Q=(A AND B) OR NOT C, A=0,B=1,C=0 gives:


**Starter Code:**
```text
{"prompt":"Cumulative Check: Apply earlier ideas","template":"1. XOR(1,1): [blank_1]\n2. NAND(1,1): [blank_2]\n3. NOR(0,0): [blank_3]\n4. For Q=(A AND B) OR NOT C, A=0,B=1,C=0 gives: [blank_4]","blanks":[{"id":"blank_1"},{"id":"blank_2"},{"id":"blank_3"},{"id":"blank_4"}],"word_bank":["0","1"]}
```