inf451 - Complexity Theory (Complete module description)
Module label | Complexity Theory |
Modulkürzel | inf451 |
Credit points | 6.0 KP |
Workload | 180 h |
Institute directory | Department of Computing Science |
Verwendbarkeit des Moduls |
|
Zuständige Personen |
|
Prerequisites | No participant requirements |
Skills to be acquired in this module | This module covers the computational complexity of algorithms. Complexity considerations are concerned with the time, the memory, and the parallelism required or allowed, for solving an algorithmic problem. In particular, one is interested in lower and/or upper time and space bounds, and in approximative investigations providing information about entire classes of algorithms. For any concrete problem, complexity theory aims at being able to find out which class it belongs to, and thus estimating the cost of the most efficient methods of solving it. Methods taught in this module are general, not depending on any particular algorithmic model or chosen programming language. Professional competence
The students:
The students:
|
Module contents |
|
Literaturempfehlungen |
|
Links | |
Language of instruction | German |
Duration (semesters) | 1 Semester |
Module frequency | irregular |
Module capacity | unlimited |
Teaching/Learning method | 1VL + 1Ü |
Previous knowledge | none |
Form of instruction | Comment | SWS | Frequency | Workload of compulsory attendance |
---|---|---|---|---|
Lecture | 2 | SoSe | 28 | |
Exercises | 2 | SoSe | 28 | |
Präsenzzeit Modul insgesamt | 56 h |
Examination | Prüfungszeiten | Type of examination |
---|---|---|
Final exam of module | At the end of the lecture period |
exercises and oral exam |