Lectures, Course Outline, and Learning Objectives

Review session

Notes for the review session.

Lecture notes

Every week, specific sections of the lecture notes will be posted as readings. You will be expected to read these sections to prepare for the following week's lectures.

  1. Jan 5–9: pages 1-16 (Chapters 1, 2)
  2. Jan 12–16: pages 17-27 (Chapters 2, 3)
  3. Jan 19–23: pages 26-34 (Chapter 3)
  4. Jan 26–30: pages 31-39 (Chapters 3, 4) — plus a problem-solving exercise: "Penny Piles"
  5. Feb 2–6: pages 38-43 (Chapter 4)
  6. Feb 9–13: pages 42-47 (Chapter 4) — plus a problem-solving exercise: "Origami Headache"
  7. Feb 23–27: pages 46-55 (Chapters 4, 5)
  8. Mar 2–6: pages 55-59 (Chapter 5) — plus a problem-solving exercise: "Product of Sums"
  9. Mar 9–13: 58-64 (Chapters 5,6)
  10. Mar 16–20: 63-68 (Chapter 6) — plus a problem-solving exercise: "Tiling"
  11. Mar 23–27: 67-73 (Chapters 6,7)
  12. Mar 30–Apr 3: 72-75 (Chapter 7) — plus a problem-solving exercise: "Diagonals"
  13. Apr 6–9: 75-79 (Chapter 7) — plus review.
    See the Tests/Exam page for advice about studying for and writing the final exam.

Course outline

Lecture topics

The following topics will be covered in this course, in the order listed.

  • Quantifiers and Implication [2 weeks]
  • Logical Connectives [2 weeks]
  • Proof Techniques [4 weeks]
  • Algorithm Analysis [2 weeks]
  • Numerical Systems [2 weeks]

Learning objectives

By the end of this course, students should:

  • be able to understand technical communications, written using logical notation,
  • be able to express themselves clearly and precisely, using logical notation,
  • be able to derive correct conclusions from logical arguments, and to generate correct logical arguments,
  • be able to analyze the complexity and correctness of algorithms (up to, but not including, the level of CSC236H),
  • know and understand number representations and error.