Discrete mathematics II : Algorithms and complexity
[ LINMA2111 ]
5.0 crédits ECTS
30.0 h + 22.5 h
2q
| Teacher(s) |
Delvenne Jean-Charles (compensates Blondel Vincent) ;
Blondel Vincent ;
|
| Language |
English
|
Place
of the course |
Louvain-la-Neuve
|
| Online resources |
> https://icampus.uclouvain.be/claroline/course/index.php?cid=INMA2111
|
| Main themes |
The course is an introduction to algorithms and their complexity from a non-numerical point of view. The principal topic is the mathematical analysis of the existence of algorithms and their complexity on the classical problems of the field.
|
| Aims |
Study of algorithms for a variety of combinatorial problems from several points of view, including existence, algorithm design, data structures, performance analysis and complexity status.
|
| Content |
Introduction to the basic algorithms for sorting and the efficient implementation of different data structures including an analysis of worst case and average case complexity. Treatment of important algorithm classes including greedy and dynamic programming algorithms. Aspects of complexity theory including NP-completeness, complexity classes and decidability.
|
| Bibliography |
-
Algorithmics: Theory and Practice, G. Brassard and P. Bratley, Prentice Hall, 1988.
-
Introduction to Algorithms, T.H. Cormen, C.E. Leierson and R.L. Rivest, MIT Press 1986.
|
Cycle et année
d'étude |
> Master [120] in Computer Science
> Master [120] in Computer Science and Engineering
> Master [120] in Mathematical Engineering
> Master [120] in Electrical Engineering
|
Faculty or entity
in charge |
> MAP
|
<<< Page précédente
|
