Discrete Structures
People
Description
The main topics of the course are propositional logic and proofs; sets, relations, and functions; combinatorics (urn models, inclusion-exclusion), graph theory (trees, planar graphs, Euler tours and Hamilton cycles) and some basic number theory (modular calculus, groups, Euler's theorem, RSA).
Objectives
This course's goal is to learn principles of the mathematics of countable structures. Hereby, central themes are modeling, abstraction, simplification, and generalization.
Teaching mode
In presence
Learning methods
Lectures and assignments.
Examination information
Midterm: 2 hrs written Final: 3 hrs written or Final: 15 min oral.
Education
- Bachelor of Science in Informatics, Lecture, 1st year
- Master of Arts in Philosophy, Lecture, Elective, 1st year
- Master of Arts in Philosophy, Lecture, Elective, 2nd year
- Master of Science in Management and Informatics, Lecture, Elective, 1st year
- Master of Science in Management and Informatics, Lecture, Elective, 2nd year