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: More Analysis of Algorithms; Sets

• Day 12: More Analysis of Algorithms; Sets
• Day 13: Review; Sets
• Day 14: Exam 1
• Day 15: Sets and Graphs

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

• Day 19: Graph Algorithms
• Day 20: 6.3: Shortest Path
• Day 21: 6.4: Graph Traversal
• Day 22: Review; 6.4: Graph Traversal
• Day 23: Exam 2
• Day 24: 7.1: Boolean Algebra
• Day 25: 7.2: Logic Networks
• Day 26: 7.3: Minimization

• Day 27: Finite State Machines (binary adder)
• Day 28: Finite State Machines (for recognition)
• Day 29: Finite State Machines (recognition and minimization)
• Day 30: Finite State Machines (minimization)
• Day 31: Review