Question

State associative law and prove it with the help of a truth table.

Answer 1

Answer:

Step-by-step explanation:

We start with the basic properties: 0.0=0.1=1.0=0, 1.1=1  

and 0+0=0, 0+1=1+0=1+1=1

From there we can construct a table to prove any property.

Note that it is not always necessary to cycle through every combination of values. For example, to prove that A.(B+C) = A.B+ A.C we only need to consider A:

If A=0 then A.(B+C)=0.(B+C)=0 and A.B+A.C = 0.B+0.C = 0

If A=1 then A.(B+C)=1.(B+C)=B+C and A.B+A.C = 1.B+1.C=B+C