Module Number

Module Title

Algorithmic Methods
Type of Module

Elective Compulsory
Work load
- Contact time
- Self study
180 h
Class time:
60 h / 4 SWS
Self study:
120 h
Duration 1 Semester
Frequency In the summer semester
Language of instruction German
Type of Exam

Written Test

Lecture type(s) Lecture, Tutorial

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.

Allocation of credits / grading
Type of Class
Type of Exam
Exam duration
of Module (%)
Prerequisite for participation INFM2420 Theoretical Computer Science 1: Algorithms and Data Structures (formerly Algorithms)
Lecturer / Other Kaufmann

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

Last offered Sommersemester 2022
Planned for Sommersemester 2024
Assigned Study Areas BIOINFM2510, INFM2510, INFM3410, MDZINFM2510, MEINFM3210