Do you know about most of the following topics in algorithms and data structures, e.g., from preparing for algorithmic programming competition or self studying?
- search and sorting algorithms (binary search, merge sort, heap sort)
- analysis of asymptotic running time for algorithms and data structures (O notation, solving recurrences)
- dynamic programming algorithms (e.g., for sequence alignment problem, knapsack problem)
- graph algorithms (e.g., depth-first search, Dijkstra's algorithm for the shortest path problem, minimum spanning trees)
If you do and you are not retaking the course, we ask you to enroll in a special exercise class for this course by filling out this form.
We recommend all other students (including students retaking this course) to
sign up for a regular exercise class.
Remark: This system of special exercise classes for students with advanced prior knowledge applies only to the course "Algorithmen and Datenstrukturen". Other courses in this semester might use different systems to assign students to exercise classes.
