Written Test

This module is about providing the basics for the field of algorithms. This module is thematically and methodologically connected to the compulsory module Algorithms. It covers a wide range, from the theoretical conception of problem solving methods, different complexity classes and application areas to practical aspects such as algorithm engineering. Topics include graphs and networks, randomized algorithms, linear programming, approximations, parametrization and Parallelism

Students demonstrate advanced knowledge of methods for data structures and algorithms, particularly for various classes of algorithms such as graph algorithms, randomized algorithms, parameterized algorithms, geometric algorithms, and parallel algorithms. For the individual topics, students can independently apply the methods to case studies and solve them, including in particular the application of proofs of correctness and efficiency analyses. The students can develop simple algorithm ideas themselves and design the corresponding analyses and practical implementations.

Cormen, Leiserson, Rivest, Stein: Introduction to Algorithms; Mehlhorn, Näher: LEDA - A platform for combinatorial and geometric computation;
Papadimitriou, Steiglitz: Combinatorial optimization : algorithms and complexity