Advanced AlgorithmicsModule description #40025 / Version 1
- 9 CP
- Oral exam
- Graded
- Winter semester
- English
This module description is not valid in the current semester (Winter semester 2026/27).
Current version (v8)
| Module / Version | #40025 / #1 |
|---|---|
| Validity | WS 2014/15 – SS 2015 |
| Available language(s) | English |
| Credit points | 9 |
| Person responsible for the module | Niedermeier, Rolf |
| Grading | Graded |
| Exam format | Oral exam |
| Language(s) of instruction | English |
Affiliation
| Faculty | Fakultät IV |
|---|---|
| Institute | Institut für Softwaretechnik und Theoretische Informatik |
| Academic chair | 34351100 FG Algorithmik und Komplexitätstheorie (AKT) |
Contact
| Office | EN 23 |
|---|---|
| Contact person | Nichterlein, André |
| E-mail address | lehre@akt.tu-berlin.de |
| Website | https://www.tu.berlin/akt/studium-lehre/lehrveranstaltungen |
Learning outcomes
Students who have completed this module can design and analyze algorithms for computational problems arising in various application contexts. When facing a concrete computational problem, they are able to choose, from a wide range of techniques, a solution strategy to efficiently solve the problem.
This includes in particular strategies for solving problems that are computationally hard in the worst case.
The course is principally designed to impart:
technical skills 40%, method skills 50%, system skills 10%, social skills 0%
This includes in particular strategies for solving problems that are computationally hard in the worst case.
The course is principally designed to impart:
technical skills 40%, method skills 50%, system skills 10%, social skills 0%
Content
Introduction to advanced and modern topics of algorithm design and analysis, with a particular emphasis on coping with presumable worst-case intractability.
Particular topics are:
- algorithmic game theory,
- algorithmic graph theory,
- computational geometry,
- algorithms for strings and permutations,
- approximation and online algorithms,
- parameterized and exact algorithms,
- randomized algorithms and analysis,
- streaming algorithms.
Particular topics are:
- algorithmic game theory,
- algorithmic graph theory,
- computational geometry,
- algorithms for strings and permutations,
- approximation and online algorithms,
- parameterized and exact algorithms,
- randomized algorithms and analysis,
- streaming algorithms.
Module components
Compulsory area
The following courses are mandatory for this module:
| Courses | Type | Number | Frequency | Language | Hours per week | Course catalog |
|---|---|---|---|---|---|---|
| Advanced Algorithms | Integrated course | 0434 L 237 | Winter semester | – | 6 | ISIS |
Workload and credit points
Advanced Algorithms (Integrated course)
| Workload description | Multiplier | Hours | Total |
|---|---|---|---|
| Präsenzzeit | 15 | 6 h | 90 h |
| Vor-/Nachbereitung + Prüfungsvorbereitung | 15 | 12 h | 180 h |
| 270 h | |||
The workload of the module adds up to 270 hours. The module therefore comprises 9 credit points.
Description of teaching and learning methods
The lecture consists of roughly 2/3 lecture and 1/3 tutorial parts; in the latter concrete problems are solved and an active participation (including homework) is expected.
Requirements for participation and examination
Desirable prerequisites for participation in the courses:
a) obligatory: basic knowledge on algorithm design
b) desirable: basic understanding of P vs. NP classification
b) desirable: basic understanding of P vs. NP classification
Mandatory requirements for the module examination registration:
This module has no examination requirements.
Completion of the module
| Grading | Graded |
|---|---|
| Exam format | Oral exam |
| Language | English |
Duration of the module
The following number of semesters is estimated for taking and completing the module: 1 semester(s).
This module can be started in the following semesters: Winter semester.
Maximum number of participants
This module is not limited to a number of students.
Registration procedures
Please register at QISPOS or directly at the Examination Office
Recommended reading, lecture notes
Lecture notes
unavailable
Electronic lecture notes
available – slides will be made available during the lecture period
Recommended literature
- *Current research literature specified during the lecture. Basic textbooks:
- Cormen, Thomas H.; Stein, Clifford; Leiserson, Charles E.; Rivest, Robert L.: Introduction to Algorithms. 3rd Edition, 2009, The MIT Press
- Kleinberg, Jon; Tardos, Éva: Algorithm Design, 2006, Pearson/Addison-Wesley
- Niedermeier, Rolf: Invitation To Fixed-Parameter Algorithms. 2006, Oxford University Press
- Skiena, Steven S.: The Algorithm Design Manual, 2nd Edition, 2008, Springer Verlag
- Williamson, David P.; Shmoys, David B.: The Design Of Approximation Algorithms. 2011, Cambridge University Press
Assigned programs
This module is not used in any program.
Computer Science Master with focus “Reliable Systems”
Computer Science diploma
Technical Computer Science Master with focus “Software Engineering”
Technical Computer Science diploma
Computer Science diploma
Technical Computer Science Master with focus “Software Engineering”
Technical Computer Science diploma
Miscellaneous
Not specified