Algorithmics I (WS 2021/22)

 

Schedule

• Lecturer: Prof. Dr. Markus Lohrey (Room H-A 7103, Tel. 0271-740-2826)
• Lectures:
  • Friday, 8:00-10:00, in H-B 4419/20
• Tutorials:
  • Thursday, 16:00 - 18:00, in H-C 3303 (Start: 21.10.2021)
• Question Time:
  • Friday, 12:00 - 14:00, via Zoom

 

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 November 17, 2021)

 

Exercise sheets

• Exercise 1
• Exercise 2
• Exercise 3
• Exercise 4
• Exercise 5
• Winter Bonus Task / Solution
• Exercise 6
• Exercise 7

 

Exams

• test exam / test exam with solutions
• exam 18.08.2022 / solutions

 

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