MAT 385: Discrete Math
Course Materials:
Syllabus
Schedule and assignments
(tentative)
Learning Objectives
Your projects
OFFICE HOURS
(
by zoom
):
Tuesday 4:30-5:30pm
Wednesday 2-3pm
Friday 9:00am.
These hours are just for your class. I am also available by appointment, if those hours won't work -- just
email me
.
Daily Agendas/Summaries
Chapters 1-4:
Day 1: Welcome -- let's go!
Day 2: Propositional Logic
Day 3: Quantifiers, Predicates, and Validity
Day 4: Predicate Logic
Day 5: 2.1: Proof Techniques
Day 6: Induction
Day 7: Recursion
Day 8: Review
Snow Day -- schedule pushed back
Day 9: Recurrence Relations
Day 10: Recurrence Relations (reprise)
Day 11: Analysis of Algorithms
Day 12: Analysis of Algorithms/Sets
Day 13: The End of Sets (well, they never end....)
Chapters 6-7:
Day 14: 6.1: Graphs
Day 15: Review for Exam 2
Day 16: 6.2: Trees
Day 17: 6.3: Decision Trees
Day 18: Applications
Day 19: 7.2: Euler Paths and Hamiltonian Circuits
Day 20: 7.3: Shortest Path and Minimal Spanning Tree
Day 21: 7.4: Graph Traversal
Day 22: Chapter 7 review and analysis
Day 23: Highlights for Exam 3
Chapters 8-9:
Day 24: 8.1: Boolean Algebras
Day 25: 8.2: Logic Networks
Day 26: 8.3: Minimization
Day 27: 9.3: Finite-State Machines
Day 28: 9.3: Finite-State Machines (recognition)
Day 29: 9.3: Finite-State Machines (minimization)
Links:
Scanning a file from OneDrive to Canvas
as a pdf.
How Google uses linear algebra to rate web pages
Notes:
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
.
Website maintained by
Andy Long
. Comments appreciated.
