‹ Back to the paper
Question 5(ii)
3 marks
Computer ScienceISC 2023 Specimen Computer Science Paper 1Truth tableBoolean Algebra
Answer the following using a truth table.
Verify if the following proposition is valid: ( P ⇒ Q ) ∧ ( P ⇒ R ) = P ⇒ ( Q ∧ R )
Verify if the following proposition is valid:
$( P \Rightarrow Q ) \wedge ( P \Rightarrow R ) = P \Rightarrow ( Q \wedge R )$
Answer
Answer
| P | Q | R | P => Q | P => R | (P => Q).(P => R) | Q.R | P => (Q.R) | (P => Q).(P => R) <=> P => (Q.R) |
| 0 | 0 | 0 | 1 | 1 | 1 | 0 | 1 | 1 |
| 0 | 0 | 1 | 1 | 1 | 1 | 0 | 1 | 1 |
| 0 | 1 | 0 | 1 | 1 | 1 | 0 | 1 | 1 |
| 0 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 |
| 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 |
| 1 | 0 | 1 | 0 | 1 | 0 | 0 | 0 | 1 |
| 1 | 1 | 0 | 1 | 0 | 0 | 0 | 0 | 1 |
| 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 |
Both sides agree in every row, so the proposition is valid (a tautology).