From 2 November 2020, the autumn semester 2020 will take place online. Exceptions: Courses that can only be carried out with on-site presence. Please note the information provided by the lecturers via e-mail.
Advanced design and analysis methods for algorithms and data structures: Random(ized) Search Trees, Point Location, Minimum Cut, Linear Programming, Randomized Algebraic Algorithms (matchings), Probabilistically Checkable Proofs (introduction).
Studying and understanding of fundamental advanced concepts in algorithms, data structures and complexity theory.
Will be handed out.
Introduction to Algorithms by T. H. Cormen, C. E. Leiserson, R. L. Rivest; Randomized Algorithms by R. Motwani und P. Raghavan; Computational Geometry - Algorithms and Applications by M. de Berg, M. van Kreveld, M. Overmars, O. Schwarzkopf.
Performance assessment information (valid until the course unit is held again)
The performance assessment is only offered in the session after the course unit. Repetition only possible after re-enrolling.
Mode of examination
written 180 minutes
Additional information on mode of examination
There will be a written midterm exam and a written final exam. Script or any other supplementary material for either exam is not permitted. The grade of the midterm exam amounts to 20% and the grade of the final exam to 60% of the final grade. Extra reading material will be distributed and two special graded assignments - related to this reading material - handed out during the course. The grade of the special assignments amounts to 20% of the final grade.
Keine Hilfsmittel erlaubt.
This information can be updated until the beginning of the semester; information on the examination timetable is binding.