Complete the truth table in Fig. 1 for the Boolean statement R=NOT A AND BR = \text{NOT } A \text{ AND } BR=NOT A AND B.
Fig. 1
| A | B | R |
|---|---|---|
| 0 | 0 | 0 |
| 0 | 1 | ..... |
| 1 | 0 | ..... |
| 1 | 1 | 0 |
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.