Exam 2 will be given on Monday, November 10, in class. It will be a
closed-book exam. Technically, the exam will be comprehensive, covering all
of the course materials given prior to the exam; however, problems will focus
on the materials given after Exam 1, including all of the lectures given
after Exam 1, the reading assignments from Rosen on §§4.1, 4.3,
4.4, 4.6, 5.1–5.4, 5.5, 9.1, 9.5, Homework 4–6 and Quizzes 3, 4.
A list of particularly important topics
Integer and modular arithmetic
Number-theoretic algorithms
Relations and their properties
Equivalence relations
Induction and strong induction
Recursive definitions and structural induction
Recursive algorithms
Program correctness
Supplementary exercises
Integers and algorithms: pp. 325, 326, Exercises 3, 7 and 25
Relations: p. 667, Exercises 1, 3 and 10
Induction and recursion: pp. 400–402, Exercises 7, 19 and
57
Finally, do not forget to review all the homework and quiz problems. The
homework and quiz problems are as important as those given above.
