Day 26, Mat385

Last time

Next time

• Announcements
  • The quiz from last week:
    • the quiz
    • the key -- nice work Grace and Toshi!

  • Your projects are due soon (Wednesday, 4/30). Then you will have until the 7th of May (by 11:59pm) to give me your evaluations (two days after your final). I'll be assigning you two projects to evaluate.

    I hope that you're working on them....

• Last time:
  • We went over section 8.2: Logic Networks, and saw how we can move smoothly between three representations of the same problem:
    1. A truth table (or "truth function")
    2. A Boolean expression
    3. A logic network

  • We saw a preview of the "big idea": once implemented as a Boolean expression, we can use Boolean algebra to write the simplest little Boolean expression which is equivalent (encodes the same information); then we implement that in "hardware" (the logic network).

• Today:
  • We'll wrap up the full adder from section 8.2: Logic Networks
  • We continue with section 8.3: Minimization, with the objective to streamline Boolean expressions in two different ways.

• Some Fun, Motivating Examples from Propositional and Predicate Calculus