All classes and the exam last three hours.
| Date | Lecturer | Topic | |||
|---|---|---|---|---|---|
| Thu, 12.09.2019 | Dimo Brockhoff | Overview of the course, Combinatorics, O-notation, data structures | slides | Exercise 1 | |
| Tue, 24.09.2019 | Dimo Brockhoff | Data structures II | slides | Exercise 2 | |
| Tue, 1.10.2019 | Dimo Brockhoff | Sorting Algorithms, Recursive Algorithms | slides | Exercise 3 | ipython notebook (template)ipython notebook (solution) |
| Tue 8.10.2019 | Dimo Brockhoff | Greedy Algorithms | slides | Exercise 4 | ipython notebook (incl. plotting) |
| Tue, 15.10.2019 | Dimo Brockhoff | Dynamic Programming | slides | Exercise 5 | |
| Thu, 31.10.2019 | Dimo Brockhoff | Randomized Algorithms and Blackbox Optimization | slides | Exercise 6 | |
| Tue, 5.11.2019 | Dimo Brockhoff | Complexity Theory I | slides | Exercise 7 | |
| Tue, 26.11.2019 | Dimo Brockhoff | Complexity Theory II | slides |