Conversion from one number base to another Binary arithmetic Equation simplification

1. Review for Exam 1 Conversion from one number base to another Binary arithmetic Equation simplification DeMorgan’s Laws Conversion to/from SOP/POS Reading equations from Truth Tables Boolean expression to Karnaugh Map Minimization using Karnaugh Maps Minterm and Maxterm Equations Minimization using don’t cares Logic to Boolean Expression conversion Word problems Determining how many gates and inputs a boolean expression has Determining Prime Implicants and Essential Prime Implicants Logical completeness

2. Conversion from one number base to another 356.8910 to Hexadecimal (2 digits)

3. Conversion from one number base to another

4. 23 6 | 141 -12 21 -18 3 Binary arithmetic

5. Equation simplification Y = (AB’ + (AB + B)) B + A Simplify and convert to SOP (A’ + B + C’)(A’ + C’ + D)(B’ + D’)

6. Equation simplification X + XY = X X + X’Y = X + Y X + XY = X (X + Y)(X + Z) = (X + YZ)

7. DeMorgan’s Laws G = {[(R + S + T)’ PT(R + S)’]’T}’

8. DeMorgan’s Laws G = {[(R + S + T)’ PT(R + S)’]’T}’ = [(R + S + T)’ PT(R + S)’] + T’ = [ R’S’T’ PT(R’S’)] + T’ = R’S’T’PTR’S’ + T’ = R’S’P(T’T) + T’ = T’

9. Conversion to/from SOP/POS (X + YZ) = (X + Y)(X + Z)

10. Reading equations from Truth Tables

11. Reading equations from Truth Tables

12. Boolean expression to Karnaugh Map AB + C’D + A’B’C + ABCD + AB’C

13. Boolean expression to Karnaugh Map AB + C’D + A’B’C + ABCD + AB’C

14. Minimization using Karnaugh Maps AB + C’D + A’B’C + ABCD + AB’C AB + C’D + B’C

15. Minterm and Maxterm Equations F(ABCD) = Sm (0,2,4,7,9,12,14,15) BC’D’ + BCD + ABC + A’B’D’ + AB’C’D

16. Minterm and Maxterm Equations F(ABCD) = Sm (0,2,4,7,9,12,14,15) BC’D’ + BCD + ABC + A’B’D’ + AB’C’D

17. Minimization using don’t cares F(ABCD) = Sm (0,1,2,11,13) + Sd (3,9,12,15) A’B’ + AD

18. Minimization using don’t cares F(ABCD) = Sm (0,1,2,11,13) + Sd (3,9,12,15) A’B’ + AD

19. Logic to Boolean Expression conversion

20. Logic to Boolean Expression conversion F = (XY + W)Z + V F = (B+C)A + BC

21. Word problems

22. Determining how many gates and inputs a boolean expression has F = (XY + W)Z + V levels gates inputs transistors inputs/gate max Z = A’B’C’ + ABC + BCD +B’C’D’ levels gates inputs transistors inputs/gate max

23. Determining how many gates and inputs a boolean expression has F = (XY + W)Z + V 4 levels 4 gates 8 inputs 16 transistors 2 inputs/gate max Z = A’B’C’ + ABC + BCD +B’C’D’ 2 levels 5 gates 16 inputs 32 transistors 4 inputs/gate max

24. Determining Prime Implicants and Essential Prime Implicants

25. Determining Prime Implicants and Essential Prime Implicants 6 prime implicants 3 essential prime implicants

26. Logical completeness Inverter AND gate OR gate

27. Logical completeness Inverter Inverter AND gate NAND Inverter OR gate NAND gate Inverter