Course Contents (Syllabus):
Propositional Logic, logical reasoning methods (mathematical induction, reductio ad absurdum, proof by contradiction, etc), sets, relations and functions, combinatorics, introduction to discrete probability.
Required course, 1st year
Prerequisites and/or related courses:
Objectives:
Learn how to
- use propositional logic
- use reasoning methods for constructing proofs
- use sets, relations and functions
- count combinations
- compute discrete probability
Teaching Methods:
Theory lectures (5h/week).
Assessment methods:
One group of exercises (homework) every 3 weeks, mid-term written examination, final written examination.
Teaching Material: Notes
Recommended reading:
- S. Epp, ‘’Discrete Mathematics with Applications’’.
- K. Rosen, ‘’Discrete Mathematics and its Applications”.
- D. Hunter, “Essentials of Discrete Mathematics”