Prashnikaप्रश्निका
Code
About
‹ 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.

Open in the Boolean algebra solver

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:
ABCB+CA+(B+C)A+B(A+B)+CB.CA.(B.C)A.B(A.B).C
00000000000
00111010000
01011110000
01111111000
10001110000
10111110000
11011110010
11111111111
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.