MAT 385: Discrete Math

• Day 1: Welcome -- let's go!
• Day 2: Propositional Logic
• Day 3: Quantifiers, Predicates, and Validity
• Day 4: Predicate Logic
• Day 5: Proof Techniques
• Day 6: Induction
• Day 7: Recursion
• Day 8: Recursion and Recurrence relations
• Day 9: Recurrence relations and Analysis of Algorithms
• Day 10: Analysis of Algorithms
• Day 11: Sets
• Day 12: Review; Sets
• Day 13: Exam 1

• Day 14: Sets
• Day 15: Graphs

  ---

  Post Spring break... Regrouping....

  ---

• Day 16: Graphs and Trees
• Day 17: Trees
• Day 18: Decision Trees

Chapters 8 and 9:

• Day 19: Boolean Algebras

• Day 20: Review
• Day 21: Exam 2

• Day 22: Logic Networks
• Day 23: Boolean Minimization

• Day 24: Finite-State Machines
• Day 25: Finite-State Machines:
  recognition and minimization

• Day 26: A Karnaugh/Quine-McCluskey Example (and start of review)
• Day 27: A FSM Example (and end of review)

• Day 28: Final Exam