discrete math - exam info

exam 1 (wed oct 3, in class)

this exam will cover chapters 1-3 of hammack. here are some things which i consider important, but this is not necessarily an exclusive list (not necessarily a sufficient list?) of topics for the exam:

in class friday and monday, i will give you practice problems (with an emphasis on the material from chapters 1 and 2, since counting should be fresher in your minds) to help prepare. i suggest you study as much as possible before these classes so you can treat these practice problems as mock exams and see where you need to improve.

exam 2 (mon nov 19, in class)

this exam will cover chapters 4-9 (excluding 8.4) and sec "10.0" (pp 154-160) of hammack. (e.g., no strong induction or fibonacci numbers, though you are allowed to use strong induction or smallest counterexample method on the exam if you wish. and this material may appear on the final exam.)

here some more specific things you should be comfortable with:

to help you prepare, here are some practice problems that i recommend you study for and try on your own (like a mock exam, but longer), and bring any questions you have to class friday before the exam. there is also a version with comments/hints for you to help check your solutions. (if you spot any typos, let me know so i can correct them)

final exam: wed dec 12 (8-10am)

the final exam will be cumulative, covering everything on exams 1 and 2, as well as some aspects of functions and cardinality (ch 12, ch 13). specifically, you should be comfortable with the following:

some suggestions for problems to review for the final are:



course home