Teaching
Teaching loads
| Year | ID | Title | Teaching load |
|---|---|---|---|
| 2025 | MIN17101 | Complementary course in discrete mathematics | 3x1.5h + 5x3h |
| 2025 | LSIN310 | Mathematics for computer science | 12x1.5h + 12x3h |
Some complementary documents regarding the courses can be found here.
Course abstracts
Complementary course in discrete mathematics
- MIN17101 – Complément de mathématiques discrètes
- Format – Intensive course over 2 weeks (lectures : 9h, tutorials: 15h), in September
- Lecturer – Franck Quessette and Jules Baudrin
- Description – This is a refresher course common to multiple masters which occurs at the very beginning of the first year of master. The aim is to go through the main notions of discrete mathematics that are needed in multiple courses, and especially the cryptography course. The first half of the course is focused on algebra structures (groups, rings, fields) and on the usage of classical results such as the (extended) Euclidean division or the Chinese Remainder Theorem. The second half is dedicated to discrete probability. The main objective is to ensure that the students can conduct a simple line of reasoning with precision.
Mathematics for computer science
- LSIN310 – Mathématiques pour l’informatique
- Format – 4.5h/week during 12 weeks (lecture: 1.5h, tutorials: 3h), from September to December
- Lecturer – Jules Baudrin
- Description – This is an introductory course to mathematics of license level. The course starts by focusing on the notions of function, order/equivalence relations, or inductive reasoning. Then modular arithmetic rules are studied, the ultimate goal being the understanding and usage of the Extended Euclidean Algorithm. Finally, the computational aspects of linear algebra are tackled: addition/multiplications of matrices, computation of determinants, and of course inversion.
