Algorithmics I (WS 2022/23)
Schedule
- Lecturer: Prof. Dr. Markus Lohrey (Room H-A 7103, Tel. 0271-740-2826)
- Lectures:
- Friday, 10:00-12:00, in H-C 3305
- Tutorials:
- Thursday, 16:00 - 18:00, in H-D 3206 (Start: 20.10.2022)
- Tutor: Michael Figelius (Room H-A 7104)
- Question Time:
- Thursday, 14:00 - 15:00, via Zoom (please contact us to get the zoom link)
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 January 13, 2023)
Exercise sheets
- Exercise 1 (Solutions)
- Exercise 2 (Solutions)
- Exercise 3 (Solutions)
- Exercise 4 (Solutions)
- Exercise 5 (Solutions)
- Exercise 6 (Solutions)
- Exercise 7 (Solutions)
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