edited by
1,661 views

1 Answer

1 votes
1 votes

AND 

$(AB)C = A(BC) = ABC.$

OR

$(A + B) + C = A + (B + C)=A+B+C$

NAND

But, $((AB)′C)′ ≠ (A(BC)′)′ $does not follow associative property.

GATE1992-02-i - GATE Overflow

XOR

$ (a⊕b)⊕c=a⊕(b⊕c)$

 

 

 

Related questions

0 votes
0 votes
1 answer
1
go_editor asked Mar 27, 2020
556 views
Non modifiable procedures are calledSerially useable proceduresConcurrent proceduresReentrant proceduresTopdown procedures
0 votes
0 votes
2 answers
2
go_editor asked Mar 27, 2020
1,082 views
In transform analysis, input portion is called :Afferent branchEfferent branchCentral TransformNone of the above
0 votes
0 votes
2 answers
3
go_editor asked Mar 27, 2020
2,487 views
The cost of a parallel processing is primarily determined by :Time complexitySwitching complexityCircuit complexityNone of the above
0 votes
0 votes
0 answers
4