1. Boolean Logic and Circuits ELEC 311 Digital Logic and Circuits Dr. Ron Hayne Images Courtesy of Cengage Learning

2. 311_022 Logic Gates

3. 311_033 Exclusive-OR (XOR)

4. Boolean Algebra 311_024 Identity laws: 1. X + 0 = X1D. X 1 = X 2. X + 1 = 12D. X 0 = 0 Idempotent laws: 3. X + X = X3D. X X = X Involution law: 4. (X')' = X Laws of complements: 5. X + X' = 15D. X X' = 0

5. Boolean Algebra 311_025 Commutative laws: 6. X + Y = Y + X 6D. XY = YX Associative laws: 7. (X + Y) + Z = X + (Y + Z) 7D. (XY)Z = X(YZ) = XYZ Distributive laws: 8. X(Y + Z) = XY + XZ 8D. X + YZ = (X + Y)(X + Z) DeMorgan's laws: 9. (X + Y )' = X'Y' 12D. (XY)' = X' + Y' Simplification theorem: 10. XY + XY' = X(Adjacency Theorem)

6. Minterms and Maxterms 311_046

7. Sum of Products (SOP) 311_027 AB' + CD'E + AC'E'

8. Product of Sums (POS) 311_028 (A + B')(C + D' + E)(A + C ' + E ' )

9. 311_07 NAND and NOR Gates 9

10. DeMorgan's Laws  (X ∙ Y)' = X' + Y'  (X + Y)' = X' ∙ Y' 311_0710

11. 311_07 SOP to NAND-NAND G = WXY + YZ 11