MAT 385: Discrete Math

• Syllabus
• Schedule and assignments (tentative)
• Learning Objectives
• Your projects (here's a link to the projects)
• Edited Highlights
• Office hours: MW 3:15-4:30; TR 6:00pm-7:00pm. Contact me if you want to meet via Zoom.

• Daily Agendas/Summaries

  Chapters 1-2: Day 1: Welcome -- let's go! Day 2: 1.1: Statements, Symbolic Representations, and Tautologies Day 3: 1.2: Propositional Logic Day 4: 1.3: Quantifiers, Predicates, and Validity Day 5: More 1.3 Day 6: 1.4: Predicate Logic Day 7: 2.1: Proof Techniques Day 8: 2.2: Induction Day 9: 2.2/3.1: Induction and recursion Chapters 3-4: Day 10: 3.1: Recursion Day 11: 3.2: Recurrence Relations Day 12: 3.3: Analysis of Algorithms Day 13: 3.3: Analysis of Algorithms (encore) Day 14: Sets Day 15: Review Day 16: Midterm Day 17: Infinity and Graphs

  Chapters 6 and 7: Day 17: Infinity and Graphs Day 18: Graphs Day 19: Graphs and Trees Day 20: Trees Day 21: Decision Trees Day 22: Euler Paths and Hamiltonian Circuits Day 23: Shortest Path and Minimal Spanning Trees Day 24: Graph Traversals (depth, breadth) Chapters 8 and 9: Day 25: Boolean Algebras Day 26: Logic Networks Day 27: Minimization Day 28: Finite State Machines Day 29: Recognition and Minimization Day 30: Review

Links:

• How Google uses linear algebra to rate web pages

• Feel free to email me with your questions.
• The Departmental Syllabus
• Taking tests in my classes
• Suggestions for the NKU Math/CS student
• Free tutoring for NKU students is available from the math center at Learning PLUS.