1
Q
A . NOT(A) =
A
0
2
Q
A . A =
A
A
3
Q
A+A =
A
A
4
Q
A + NOT(A) =
A
1
5
Q
A + 0 =
A
A
6
Q
A + 1 =
A
1
7
Q
A . 0 =
A
0
8
Q
A . 1 =
A
A
9
Q
Commutative rule
A
YX = XY Y+X = X+Y
10
Q
Associative rule
A
X(YZ) = (XY)Z X+(Y+Z) = (X+Y)+Z
11
Q
A(BC) =
A
(AB)C
12
Q
Distributive rule
A
X(Y+Z) = XY + XZ
13
Q
(X+Y)(W+Z) =
A
XW + XZ +YW +YZ
14
Q
De Morgan’s Law
A
NOT(AB) = NOT(A) + NOT(B)
OR to AND/AND to OR and invert the NOTs
15
Q
Why is the NAND gate universal?
A
Any type of gate can be formed from NANDS alone.
16
Q
Why minimise the number of gate types used?
A
- Lower manufacture costs
- Higher processing speed
- Reduce power consumption
