time	7:00pm–10:00pm
date	Tuesday 22 December
place	TC VIVA

The exam is for three hours. It is closed notes and closed book. No aids are allowed, except a simple calculator will be permitted.

The final exam is cumulative, so it covers all the topics we have covered in the course. That is, what we have covered in the lectures, the corresponding sections in the textbook, the tests, and the assignments. (See Class Materials / Lecture Notes on the class homepage for this list.) To reiterate, these are as follows.

1. introduction &propositional logic

   • Chapter 1: §1–3

2. propositional logic continued, predicate logic

   • Chapter 1: §4, 5

3. arguments & proofs

   • Chapter 1: §6–8

4. sets & functions

   • Chapter 2: §1–3

5. sequences, summations, & cardinalities

   • Chapter 2: §4,5

6. algorithms: basics, growth of functions, & algorithmic complexity

   • Chapter 3: §1–3

7. induction & recursion

   • Textbook Slides: Chapter 5, §1–3 (PDF)

8. counting / combinatorics

   • Chapter 6: §1, 3, & 4

9. advanced counting techniques: solving recurrence relations

   • Chapter 8: §1, 2, & 3

10. relations

    • Chapter 9: §1, 2, & 3

There will likely be seven or eight main questions of the style that you have seen on the two term tests, and in the exercises. Questions will follow the style and content as in the assignments, problems worked in lecture, and on the term tests. (As the final-exam period is three hours, this will be comparatively shorter than the term tests. This means that time pressure should be less.)

Remember that the exam is cumulative and covers all the topics of the course.

The exam is closed-book and closed-note. No aids are allowed, except a simple calculator will be permitted.

The final exam is worth 40% of the total grade.