Complete the truth table for the following Boolean expression:
Q=(A AND NOT B) OR C Q = (A \text{ AND } \text{NOT } B) \text{ OR } C Q=(A AND NOT B) OR C| A | B | C | Q |
|---|---|---|---|
| 0 | 0 | 0 | |
| 0 | 0 | 1 | |
| 0 | 1 | 0 | |
| 0 | 1 | 1 | |
| 1 | 0 | 0 | |
| 1 | 0 | 1 | |
| 1 | 1 | 0 | |
| 1 | 1 | 1 |
Practise OCR GCSE Computer Science Boolean logic with exam-style questions for GCSE Computer Science. 27 questions, matched to the OCR GCSE Computer Science (J277) specification and written in Component 01 and Component 02 style. Every question includes a full worked solution and mark scheme, so you can see where marks are awarded rather than just whether you got the answer right.