Algorithmics I (WS 2017/18)
Important news
- The lecture will cover the first half of the semester (2 lectures per week) from October 13 to December 1. In the second half of the semester we will offer the lecture Algorithmics II.
- The tutorials start at Thursday, 26.10.2017.
Organization
- Lecturer: Prof. Dr. Markus Lohrey (Room H-A 7103, Tel. 0271-740-2826)
- Lectures:
- Friday, 12:00-14:00, in H-F 104/105
- Friday, 14:00-16:00, in H-F 104/105
- Tutorials:
- Thursday, 16:00-18:00, in H-F 104/105 (Danny Hucke)
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 30.11.2017)
Exercise sheets
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