MAT 385: Discrete Math

• Syllabus
• Schedule and assignments (tentative)
• Learning Objectives
• Your projects
• Office hours (all office hours are by Zoom): MW 11:00-12:00; MW 4:00-5:00; TR 2:00-3:00.
• If you need to Zoom to class, here's the link.
• Edited Highlights

• 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: 1.4: Predicate Logic Day 6: 2.1: Proof Techniques Day 7: 2.2: Induction Day 8: 2.2: Induction; Review Day 9: Exam 1 Chapter 3 and 4: Day 10: Recursion Day 11: Recurrence Relations Day 12: Analysis of Algorithms Day 13: The Euclidean Algorithm Day 14: Sets

  Chapters 6 and 7: Day 15: Graphs and their representations Day 16: Graphs, continued Day 17: Trees and their representations Day 18: Decision Trees Day 19: Euler Paths and Hamiltonian Circuits Day 20: Exam 2 review Day 21: Exam 2 Day 22: Shortest Paths Day 23: Shortest Paths and Graph Traversal Chapter8: Day 24: Boolean Algebras Day 25: Logic Networks Day 26: Minimization Chapter9: Day 27: Finite State Machines Day 28: More FSMs: Recognition Day 29: 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.