Ch 1. Covered everything except: pg 19-21, Logic puzzles, logic circuits; pg 51-2 Logic programming; pg 103-5 Tilings;

Ch 2: Omit 2.6 Matrices.Leave out Theorem 2 and Definition 4 on pg 174-5

Ch 3: No questions will be asked on designing algorithms but you should be able to understand algorithms.
Leave out pg 198-200 Greedy algorithms; pg 201-2 Halting problem; pg224-7 Algorithmic paradigms, Understanding the complexity of algorithms.

Ch 5: Omit 5.5. Omit pg 324-6 Proving results about algorithms, creative uses of mathematical induction.
Omit pg 338-340 Using Strong Induction in Computational Geometry; pg 340-1 Proofs using the well-ordering property; the material on pg 351-357 (don't skip the problems on pg 357).

Ch 6: Only 6.2 was covered

Ch 8: 8.4,8.5,8.6 were NOT covered. Omit the example on dynamic programming pg 508-510.Omit Theorem 2, pg 517; Theorem 4, pg 519; linear nonhomogenous recurrence relations pg 520-524.

Appendix 2

Appendix 3 was not covered separately but please review it if you are unsure of pseudocode conventions.