Version française
The goal of this major is the familiarise the student with certain advanced concepts in discrete mathematics such as the analysis of complex algorithms, numerical calculation, combinatorial problems, as well as computer science tools pertaining to applied mathematics.
> Legend 
|
||||||||
|
The student shall select |
||||||||
| De 15 à 30 credits parmi | ||||||||
| Annual block | ||||||||
| 1 | 2 | |||||||
LINGI1123
|
Computability and complexity | Yves Deville | 30h+30h | 5 credits | 2q | x | x | |
|
LINMA2111
|
Discrete mathematics II : Algorithms and complexity | Vincent Blondel, Jean-Charles Delvenne (coord.) | 30h+22.5h | 5 credits | 2q | x | x | |
|
LINMA2450
|
Combinatorial optimization | Jean-Charles Delvenne, Julien Hendrickx | 30h+22.5h | 5 credits | 1q | x | x | |
|
LINMA2472
|
Advanced topics in discrete mathematics | Vincent Blondel (coord.), Jean-Charles Delvenne, Gautier Krings (compensates Vincent Blondel) | 30h+22.5h | 5 credits | 1q | x | x | |
|
LINMA2710
|
Numerical algorithms | Paul Van Dooren | 30h+22.5h | 5 credits | 2q | x | x | |
|
LMAT2450
|
Cryptography | Olivier Pereira | 30h+15h | 5 credits | 1q | x | x | |
|
LMAT2460
|
Finite mathematics and combinatorial structures | Jean-Charles Delvenne, Jean-Pierre Tignol | 30h | 5 credits | 1q | x | x | |
|
LSINF1121
|
Algorithmics and data structures | Pierre Schaus | 30h+30h | 5 credits | 1q | x | x | |
