21.228 Discrete Mathematics
This course introduces three of the fundamental areas of
discrete mathematics: enumeration, graph theory and discrete
probability. The introduction to enumeration includes
recurrence relations, generating functions and the
principle of inclusion and exclusion. The introduction
to graph theory includes topics such as paths,
connectivity, Eulerian and Hamilton cycles, planar graphs,
Euler's Theorem, matchings, and trees.
Course Instructor:
Tom Bohman
Wean Hall 6204
Phone: (412) 268-8485
Email: tbohman
Office Hours: Wednesday 10:00-12:00
Teaching Assistant:
Deepak Bal
Wean Hall 7116
Email: dbal AT cmu DOT edu
Office Hours: Wednesday 4:30-5:30 and Thursday 4:30-5:30
Exam period office hours
Prof. Bohman: Monday May 7 10:00-11:30 and Wednesday May 9 10:00-noon
Deepak Bal: Tuesday May 8 4:00-6:00pm and Wednesday May 9 4:00-6:00pm
Review Sheet for Test 1:
Postscript
PDF
Homework 4:
Postscript
PDF
Homework 5:
Postscript
PDF
Review Sheet for Test 2:
Postscript
PDF
Homework 6:
Postscript
PDF
Homework 7:
Postscript
PDF
Homework 8:
Postscript
PDF
Review Sheet for Test 3:
Postscript
PDF
Review Sheet for the Final Exam:
Postscript
PDF