‹ Back to the paper
Question 5(iii)
2 marks
Computer ScienceISC 2025 Improvement Computer Science Paper 1Truth tableBoolean Algebra
Answer the following using a truth table.
Verify if the following compound proposition is valid or not using the truth table.
Answer
Answer
| A | B | C | A ∧ B | A ∧ B ∧ C | (A ∧ B) ∧ C => (A ∧ B ∧ C) | (A ∧ B) <=> (A ∧ B ∧ C) | ((A ∧ B) ∧ C => (A ∧ B ∧ C)) = ((A ∧ B) <=> (A ∧ B ∧ C)) |
| 0 | 0 | 0 | 0 | 0 | 1 | 1 | 1 |
| 0 | 0 | 1 | 0 | 0 | 1 | 1 | 1 |
| 0 | 1 | 0 | 0 | 0 | 1 | 1 | 1 |
| 0 | 1 | 1 | 0 | 0 | 1 | 1 | 1 |
| 1 | 0 | 0 | 0 | 0 | 1 | 1 | 1 |
| 1 | 0 | 1 | 0 | 0 | 1 | 1 | 1 |
| 1 | 1 | 0 | 1 | 0 | 1 | 0 | 0 |
| 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 |
In the row A = 1, B = 1, C = 0 the two sides differ (1 and 0), so the last column is not 1 in every row and the proposition is not valid.