Discrete mathematics and computer science

This option aims to make the student familiar with some advanced topics in discrete mathematics such as algorithm analysis (complexity), numerical analysis, combinatorial problems, and the computer tools which are specific to applied mathematics.

Legend
MandatoryOptional
Courses not taught this academic yearPeriodic courses not taught this academic year
Periodic courses taught this academic yearTwo year courses
Click on the course code to see detailed informations (objectives, methods, evaluation...)
Year
12

L'étudiant qui choisit cette option sélectionnefrom 15to 30 créditsamong
Optional INGI1123

computability and complexity  (in French) Yves Deville, Baudouin Le Charlier (supplée Yves Deville)30h + 30h 4credits 2q xx
Optional INMA2111

Discrete mathematics II : Algorithms and complexity   (in English) Vincent Blondel (coord.), Laurence Wolsey30h + 22.5h 5credits 2q xx
Optional INMA2450

Combinatorial optimization   (in English) Laurence Wolsey30h + 22.5h 5credits 1q xx
Optional INMA2710

Numerical algorithms  (in English) Paul Van Dooren30h + 22.5h 5credits 2q xx
Optional INMA2720

Computing techniques for applied mathematics  (in French) N.30h + 22.5h 5credits 2qCourses not taught this academic year xx
Optional MAT2450

Cryptography  (in English) Olivier Pereira, Jean-Jacques Quisquater30h 5credits 1q xx
Optional MAT2460

Finite mathematics and combinatorial structures  (in French) Mélanie Raczek, Jean-Pierre Tignol30h 5credits 1q xx
Optional SINF1121

Algorithmics and data structures  (in French) Pierre Dupont30h + 30h 5credits 1q xx
 
| 27/07/2009 |