Algorithmics I (WS 2023/24)
Schedule
- Lecturer: Prof. Dr. Markus Lohrey (Room H-A 7103, Tel. 0271-740-2826)
-
Lectures:
- Friday, 10:15-11:45, in AR-D 5105
-
Tutorials:
- Thursday, 14:15 - 15:45, even weeks in H-D 3206 (Start: 19.10.2022)
- Thursday, 16:15 - 17:45, even weeks in H-D 3206 (Start: 19.10.2022)
- Thursday, 16:15 - 17:45, odd weeks in H-D 3206 (Start: 26.10.2022)
- Tutor: Julio Xochitemol (Room H-A 7104)
We will discuss important design principles for efficient algorithms (divide & conquer, greedy algorithms, dynamic programming) using concrete applications (e.g. sorting, graph algorithms, numerical algorithms). We will also introduce problem specific data structures (e.g. search trees, union-find data structures) and the necessary mathematical tools for analyzing algorithms.
Topics
- Divide and Conquer
- Greedy algorithms
- Dynamic programming
- Sorting
- Graph algorithms
Slides (from December 08, 2023)
Exercise sheets
Exams
Literature
- Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein, Introduction to Algorithms (3. Edition). MIT Press 2009
- Thomas Ottmann, Peter Widmayer, Algorithmen und Datenstrukturen (5. Edition). Springer 2012
- Uwe Schöning, Algorithmik. Spektrum Akademischer Verlag 2001
Impressum