<- Archives UCL - Programme d'études ->

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
Mandatory Optional
Courses not taught this academic year Periodic courses not taught this academic year
Periodic courses taught this academic year Two year courses
Click on the course code to see detailed informations (objectives, methods, evaluation...)
Year
1 2

L'étudiant qui choisit cette option sélectionnefrom 15 to 30 credits among
Optional LINGI1123

 computability and complexity  (in French) Yves Deville 30h + 30h  4credits  2q  x x
Optional LINMA2111

 Discrete mathematics II : Algorithms and complexity   Vincent Blondel 30h + 22.5h  5credits  2qCourses not taught this academic year  x x
Optional LINMA2450

 Combinatorial optimization   Jean-Charles Delvenne 30h + 22.5h  5credits  1q  x x
Optional LINMA2472

 Advanced topics in discrete mathematics  (in French) N. 30h + 22.5h  5credits  1qCourses not taught this academic year  x x
Optional LINMA2710

 Numerical algorithms  Paul Van Dooren 30h + 22.5h  5credits  2q  x x
Optional LMAT2450

 Cryptography  Olivier Pereira 30h  5credits  1q  x x
Optional LMAT2460

 Finite mathematics and combinatorial structures  (in French) Mélanie Raczek 30h  5credits  1q  x x
Optional LSINF1121

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