Photo AI
Complete the truth table in Fig - OCR - GCSE Computer Science - Question 1 - 2023 - Paper 1
Question 1
Complete the truth table in Fig. 1 for the Boolean statement P = NOT(A AND B). | A | B | P | |---|---|---| | 0 | 0 | 1 | | 0 | 1 | | | 1 | 0 | | | 1 | 1 | 0 | ... show full transcript
Worked Solution & Example Answer:Complete the truth table in Fig - OCR - GCSE Computer Science - Question 1 - 2023 - Paper 1
Step 1
Complete the truth table for P = NOT(A AND B)
Answer
To complete the truth table for the statement P = NOT(A AND B), we need to evaluate P based on the values of A and B.
-
When A = 0 and B = 0:
- A AND B = 0 AND 0 = 0
- P = NOT(0) = 1
-
When A = 0 and B = 1:
- A AND B = 0 AND 1 = 0
- P = NOT(0) = 1
-
When A = 1 and B = 0:
- A AND B = 1 AND 0 = 0
- P = NOT(0) = 1
-
When A = 1 and B = 1:
- A AND B = 1 AND 1 = 1
- P = NOT(1) = 0
Thus, the completed truth table is:
| A | B | P |
|---|---|---|
| 0 | 0 | 1 |
| 0 | 1 | 1 |
| 1 | 0 | 1 |
| 1 | 1 | 0 |
Step 2
Tick (✓) one box to identify the correct logic diagram for P = NOT(A AND B)
Answer
The correct logic diagram for P = NOT(A AND B) can typically be identified using a NOT gate followed by an AND gate. You would look for a diagram that shows both A and B going into an AND gate, with the output of that AND gate going into a NOT gate. Therefore, you would tick the box that illustrates this configuration.