All classes and the exam last three hours.
| Date | Lecturer | Topic | |||
|---|---|---|---|---|---|
| Mon, 21.09.2020 | Dimo Brockhoff | Overview of the course, Combinatorics, O-notation, data structures | slides | Exercise 1 | |
| Mon, 28.09.2020 | Dimo Brockhoff | Data structures | slides | Exercise 2 | |
| Mon, 5.10.2020 | Dimo Brockhoff | Sorting Algorithms, Recursive Algorithms | slides | Exercise 3 | ipython notebook (template) |
| Mon, 12.10.2020 | Dimo Brockhoff | Greedy Algorithms | slides | Exercise sheet |
code template (Jupyter notebook) |
| Mon, 19.10.2020 | Dimo Brockhoff | Dynamic Programming | slides | Exercise 5 | |
| Mon, 2.11.2020 | Dimo Brockhoff | Randomized Algorithms and Blackbox Optimization | slides | Exercise 6 | |
| Mon, 16.11.2020 | Dimo Brockhoff | Complexity Theory I | |||
| Mon, 23.11.2020 | Dimo Brockhoff | Complexity Theory II |