Complete the following truth table for the logic circuit shown in Figure 1 by filling in the empty cells.
| P | Q | R | S | T | U |
|---|---|---|---|---|---|
| 0 | 0 | 0 | 0 | 1 | 1 |
| 0 | 0 | 1 | 0 | 0 | 0 |
| 0 | 1 | 0 | 0 | 1 | 1 |
| 0 | 1 | 1 | 0 | 0 | 0 |
| 1 | 0 | 0 | |||
| 1 | 0 | 1 | 0 | 0 | 0 |
| 1 | 1 | 0 | 1 | ||
| 1 | 1 | 1 |
Boolean logic Questions
Practise AQA GCSE Computer Science Boolean logic with exam-style questions for GCSE Computer Science. 83 questions, matched to the AQA GCSE Computer Science (8525) specification and written in Paper 1 and Paper 2 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.