‹ Back to the paper
Question 5(ii)
3 marks
Computer ScienceISC 2025 Computer Science Paper 1Truth tableBoolean Algebra
Answer the following using a truth table.
By using truth table, verify if the following proposition is valid or not.
Answer
Answer
| X | Y | ~X | ~X => Y | (~X => Y) ∧ X | X ∧ ~Y | X ∧ Y | (X ∧ ~Y) ∨ (X ∧ Y) | (~X => Y) ∧ X <=> (X ∧ ~Y) ∨ (X ∧ Y) |
| 0 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 1 |
| 0 | 1 | 1 | 1 | 0 | 0 | 0 | 0 | 1 |
| 1 | 0 | 0 | 1 | 1 | 1 | 0 | 1 | 1 |
| 1 | 1 | 0 | 1 | 1 | 0 | 1 | 1 | 1 |
Both sides have the same value in every row (the last column is all 1s), so the proposition is valid.