MAT 385: Discrete Math

• Day 1: Welcome!
• Day 2: Elements of Logic
• Day 3: Propositional Logic
• Day 4: Quantifiers, Predicates, and Validity
• Day 5: Predicate Logic

Chapter 2:

• Day 6: Proof Techniques
• Day 7: Induction
• Day 8: Recursion
• Day 9: Recursion and Recurrence relations
• Day 10: Recursion and Recurrence relations
• Day 11: Analysis of Algorithms
• Day 12: Review and Analysis of Algorithms

• Day 13: Exam 1

• Day 14: Analysis of Algorithms, Sets

• Day 14: Analysis of Algorithms, Sets
• Day 15: Sets and Graphs

• Day 16: Graphs
• Day 17: Graphs/Trees
• Day 18: Graphs/Trees
• Day 19: Decision Trees

• Day 20: Graph Algorithms
• Day 21: 6.3: Shortest Path
• Day 21.5: Exam 2
• Day 22: 6.4: Graph traversal

• Day 23: 7.1: Boolean Algebra
• Day 24: Logic Networks
• Day 25: Minimization

• Day 26: Finite State Machines
• Day 27: Finite State Machines (encore)
• Day 28: Final thoughts, Review