After reviewing all the materials posted in Week 4,

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

1. Who is George Boole?
2. What are the members of the set of values used for Boolean algebra?
3. What are the 3 operators used in Boolean algebra? And how do they work?
4. What is the order of operations (operator precedence) for the Boolean operators?
5. List the Huntington Postulates and show the equations to be equivalent using a truth table.
6. Use all the Boolean Identities (and their duals) to simplify a Boolean expression.
7. Know how to create the dual of a Boolean expression.
8. Be able to determine the output of a Boolean expression/function using a truth table.
9. Create a logic gate for a Boolean expression/function.
10. Create a Canonical Form using minterms (SOP).
11. Create a Canonical Form using maxterms (POS)
12. And from the textbook:
    Digital Design, 6th Ed.
    Pages: 76 – 80
    Numbers: 2.1, 2.2, 2.3, 2.5, 2.6, 2.9, 2.11, 2.12, 2.13, 2.17, 2.22, 2.27, 2.28, 2.29, 2.30, 2.31
13. For fun: Could you build a logic gate to represent: (p nand q) without using the nand gate?