Algorithmics I (WS 2020/21)
Important news
- The lecture will cover the first half of the semester (2 lectures per week) from 28.10.2020 to 11.12.2020. In the second half of the semester we will offer the lecture Algorithmics II.
- Lectures will be presented via zoom. Recorded videos will be made available. Access data for the zoom meetings will be send via email.
- Important: Pleasure ensure that you are registered in unisono for the course, otherwise we cannot reach you via email.
- The tutorials start on November 3.
Organization
- Lecturer: Prof. Dr. Markus Lohrey (Room H-A 7103, Tel. 0271-740-2826)
- Lectures:
- Wednesday 8:30:00-10:00 via zoom
- Friday, 8:30-10:00 via zoom
- Tutorials:
- Tuesday, 14:00-16:00 via zoom (Michael Figelius)
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
Videos
Exercise sheets
- Exercise 1 (Solution)
- Exercise 2 (Solution)
- Exercise 3 (Solution)
- Exercise 4 (Solution)
- Exercise 5 (Solution)
- Exercise 6 (Solution)
- Exercise 7 (Solution)
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