Textbook:
The textbook we will follow is Kenneth H. Rosen, Discrete Mathematics and its applications, seventh edition, McGrawHill.Visit its website for more material and exercises.
Also, the homework from last year's course is a good source of exercises.
Solved exercises:
The grading schemes in the solutions can help you decide what is important to remember for each exercise.- Solutions Assignment 1
- Solutions Assignment 2
- Solutions Assignment 3
- Solutions Assignment 4
- Solutions Assignment 5
- Solutions Assignment 7
- Solutions Assignment 8
- Solutions Assignment 9
- Solutions Assignment 10
- Solutions Assignment 11
- Solutions Assignment 12
Midterm:
- Midterm Version A
- Midterm Version B
- Brief overview about final exam
Review material:
Important concepts to have in mind:
- Logic: Logical equivalences and negating statements with quantifiers.
- Proof Methods: Mathematical Induction, Strong Induction and Pigeonhole principle.
Other slides from class:
- Introduction slides.
- Remarks on the logic circuit examples.
- Slides on sets.
- Slides on functions.
- Slides on recursive structures Part I.
- Slides on recursive structures Part II.
- Slides on combinatorics All week.
- Enumeration exercises with solutions but no explanations.