Math 3614: Study Guide 8 (11/13-11/20)

Sections 9.1, 9.2, 9.3

Objectives:

1. Learn the following terms:
   • Boolean sum, product, complement
   • Boolean variable, Boolean expression, Boolean function
   • Boolean identities
   • DeMorgan's laws
   • dual
   • Boolean Algebra (look at this, but don't bother memorizing the definition)
   • XOR
   • literal
   • minterm
   • disjunctive normal form (sum-of-products expansion)
   • conjunctive normal form (product-of-sums expansion)
   • functional completeness
   • NAND, NOR
   • logic gates
   • half adder, full adder
2. Become comfortable working the following types of problems:
   1. Evaluate a Boolean expression. (exercise 1)
   2. Use tables to prove that two Boolean functions are equivalent (or not equivalent).
   3. State the dual of a Boolean expression.
   4. Given a table describing a Boolean function, find a Boolean expression in disjunctive normal form that represents the function.
   5. Given a table describing a Boolean function, find a Boolean expression in conjunctive normal form that represents the function.
   6. Given a simple Boolean expression, rewrite the expression using only the NAND operator or the NOR operator.
   7. Given a Boolean expression, construct a circuit that evaluates the expression.
3. Problem List:Learn to work the following problems:
   1. Section 9.1: 7, 13, 15, 17, 19
   2. Section 9.2: 3, 11, 14, 15
   3. Section 9.3: 3, 6

   Answers to even numbered problems

   Click here for answers to the even numbered problems.

Evaluation: