CSCI 1323 (Discrete Structures), Spring 2002:
Review for Exam 2

Format of the exam

The exam will be in class April 4. You will have 75 minutes. You may use your textbook and any notes or papers you care to bring, but you may not use other books, a calculator or computer, or each other's papers.

The questions will be similar in form to those in the homework assignments and daily end-of-lecture quizzes.

Lecture topics to review

You are responsible for all material covered in class or in the assigned reading, up through the end of chapter 2. (See Homeworks and other assignments for a list of assigned reading.) You should review in particular the following topics. This list is not necessarily exhaustive, but should give you an idea of what topics I consider most significant.

• Proofs of program correctness:
  • Rules for assignment, conditional statements, loops.
  • Combining these rules to verify correctness of simple programs.

• Proof techniques:
  • Direct proofs, proof by cases, proof by contraposition, proof by contradiction.
  • Proofs by induction.

• Recursion and recurrence relations:
  • Recursive definitions of sequences, sets, operations, and algorithms.
  • Defining and solving recurrence relations.

• Analysis of algorithms:
  • Defining and solving recurrence relations to estimate the number of basic operations performed by a recursive algorithm.