After reviewing all the materials posted in Week 5 (and include a review of Week 3's start to the topic of Minimization Techniques),

you should be able to understand these concepts/answer these questions.

  1. Minimization Technique for Boolean Expressions: using Boolean Algebra Identities (and their duals)
  2. Canonical Forms: Technique for finding a Boolean Expression for desired output (F) in a truth table using minterms (SOP)
  3. Canonical Forms: Technique for finding a Boolean Expression for desired output (F) in a truth table using maxterms (POS)
  4. Why would you choose SOP over POS or vise versa?
  5. How to step up a Karnaugh map (k-map) grid for 2,3, or 4 variables
  6. Rules for grouping in k-maps
  7. Can you "group" 4 corners in a k-map?
  8. Ability to apply a k-map to a given function (F) output from a truth table, determine the groupings and finally create the expression for the function.
  9. Ability to apply a k-map to a given function (F) output from a summation notation (SOP), determine the groupings and finally create the expression for the function.
  10. Ability to apply a k-map to a given function (F) output from a product notation (POS), determine the groupings and finally create the expression for the function.
  11. Ability to use the basic set of logic gates (inverter, AND, OR) to diagram a logic circuit.
  12. Ability to create the Boolean Expression, given a Logic Gate Diagram
  13. Ability to diagram a more complex logic gate (NAND, NOR, XOR, X-NOR) using only the basic set of logic gates (inverter, AND, OR)
  14. Have you completed all the worksheets and problems listed on the course home page as well?