Algorithmics I (WS 2024/25)

Schedule

Lecturer: Prof. Dr. Markus Lohrey (Room H-A 7103, Tel. 0271-740-2826)
Lectures:
- Friday, 10:15-11:45, in H-C 3305
Tutorials:
- Thursday, 14:15 - 15:45, even weeks in H-D 3206 (Start: 17.10.2024)
- Thursday, 16:15 - 17:45, even weeks in H-D 3206 (Start: 17.10.2024)
- Thursday, 16:15 - 17:45, odd weeks in H-D 3206 (Start: 24.10.2024)
- Tutor: Alexander Thumm (Room H-A 7105)

Important Information

Please register for the coursework achievement in Algorithms 1 (4INFMA028-S). Without the coursework achievement you cannot attend the exam. In order to pass the coursework achievement you have to present during the semester at least one of the exercises from the exercise sheets successfully on the black board in your tutorial class.

Topics

Divide and Conquer
Greedy algorithms
Dynamic programming
Sorting
Graph algorithms

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.

Slides

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

Aktualisiert via XIMS am 26.3.2025 von A. Thumm