Theoretical Computer Science

CS 406 Theoretische Informatik

Spring Semester 2025 | German

The lecture provides an algorithm-oriented introduction to central areas of theoretical computer science such as basic computational models and mutual simulations, decidability, complexity theory (definition and structure of basic complexity classes, reducibility, NP-completeness), information theory and cryptography, automata theory, basics of programming languages and syntax analysis.

Lecture

The lecture will take place weekly on

Monday, 15:30 – 17:00h in C013
Wednesday, 13:45 – 15:15h in C013

The first lecture takes place on Monday, 10.02.2025, 15:30 – 17:00h in C013.

Six of the lectures will be replaced by tutorials, see the next section.

Tutorials

There will be six tutorials. Time slots and rooms are the same as for the lectures. The dates are the following:

Wednesday, 26.02.25
Wednesday, 12.03.25
Wednesday, 26.03.25
Wednesday, 09.04.25
Wednesday, 07.05.25
Wednesday, 21.05.25

Any changes will be posted on this side and communicated via ILIAS.

Materials

The lecture slides as well as the exercise sheets and their corresponding solutions are available in the lecture's ILIAS course.

Literature

Wegener, Ingo: Theoretische Informatik – eine algorithmenorientierte Einführung, Teubner Verlag, 2005.
Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein: Algorithmen – Eine Einführung, Oldenbourg, 2010.

Contact

Conntact via email to linda.scheu-hachtelmail-uni-mannheim.de