‹ Back to the paper
Question 1(a)
1 mark
Computer ScienceISC 2020 Specimen Computer Science Paper 1Short answerBoolean Algebra
Answer the following in short.
State Associative law and prove it with the help of a truth table.
Answer
Answer
Associative law: the way in which the variables are grouped in an OR (or AND) operation does not change the result.
$A + (B + C) = (A + B) + C$ and $A \cdot (B \cdot C) = (A \cdot B) \cdot C$
Truth table proof:
The columns for $A+(B+C)$ and $(A+B)+C$ are identical, and so are the columns for $A.(B.C)$ and $(A.B).C$, so the Associative law is proved.
| A | B | C | B+C | A+(B+C) | A+B | (A+B)+C | B.C | A.(B.C) | A.B | (A.B).C |
|---|---|---|---|---|---|---|---|---|---|---|
| 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |
| 0 | 0 | 1 | 1 | 1 | 0 | 1 | 0 | 0 | 0 | 0 |
| 0 | 1 | 0 | 1 | 1 | 1 | 1 | 0 | 0 | 0 | 0 |
| 0 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 0 | 0 | 0 |
| 1 | 0 | 0 | 0 | 1 | 1 | 1 | 0 | 0 | 0 | 0 |
| 1 | 0 | 1 | 1 | 1 | 1 | 1 | 0 | 0 | 0 | 0 |
| 1 | 1 | 0 | 1 | 1 | 1 | 1 | 0 | 0 | 1 | 0 |
| 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 |