Boolean algebra (week 2 level 0)
Equivalent circuit
What is an equivalent circuit?
It is when the same inputs yield the same outputs
You can use NAND gates to create any other gate, give it ago for the following; you don't need to know this its just good practice + the shitty teacher said that so not entirely sure if its true
OR
/Untitled.png)
NOT
/Untitled%201.png)
AND
/Untitled%202.png)
NOR
/Untitled%203.png)
XOR
/Untitled%204.png)
XNOR
/Untitled%205.png)
Boolean algebra
What is the order of presidence?
high
NOT
AND
OR
low
Give examples of the following
Commutative law
A + B = B + A
A.B = B.A
Associative law
A + (B + C) = (A + B) + C
A(B.C) = (A.B)C
Distributive law
A(B + C) = (A + B)(A + C) doesn't normally work in maths
A + BC = (A + B)(A + C)
A(B + C) = (A.B) + (A.C)
Identity law
when you perform a operation on its self its self is always the output
A.B + A.notB = A
A + A = A
A + (A.B) = A
Redundancy law
When a input is made negligible
A + 1 = 1
1.A = A
0 + A = A
0.A = 0
A + notA = 1
A.notA = 0
A + A.B = A
De Morgan's law
not(A + B) = notA.notB
All laws with associated NAND and NOR equivalents
/Untitled%206.png)