VVZ API is not affiliated with ETH Zurich. Data might be outdated or incorrect. Please view the official ETHZ Vorlesungsverzeichnis for binding information.

252-0057-00L 7 Credits BSC D-MATH , D-INFK
You're viewing possible stale or outdated data. Please check the latest semester for more up-to-date information.

Theoretical Computer Science

Theoretische Informatik

Lecturers & Examiners: Prof. em. Dr. Juraj Hromkovic, Dr. Hans-Joachim Böckenhauer, Prof. Dr. Dennis Komm
VVZ CR 4.47

Last Updated: 2026-06-01 11:31:15

Abstract

Concepts to cope with: a) what can be accomplished in a fully automated fashion (algorithmically solvable) b) How to measure the inherent difficulty of tasks (problems) c) What is randomness and how can it be useful? d) What is nondeterminism and what role does it play in CS? e) How to represent infinite objects by finite automata and grammars?

Objective

Learning the basic concepts of computer science along their historical development

Content

This lecture gives an introduction to theoretical computer science, presenting the basic concepts and methods of computer science in its historical context. We present computer science as an interdisciplinary science which, on the one hand, investigates the border between the possible and the impossible and the quantitative laws of information processing, and, on the other hand, designs, analyzes, verifies, and implements computer systems. The main topics of the lecture are: - alphabets, words, languages, measuring the information content of words, representation of algorithmic tasks - finite automata, regular and context-free grammars - Turing machines and computability - complexity theory and NP-completeness - design of algorithms for hard problems

Resources

Lecture Notes

The lecture is covered in detail by the textbook "Theoretical Computer Science".

Literature

Basic literature: 1. J. Hromkovic: Theoretische Informatik. 5th edition, Springer Vieweg 2014. 2. J. Hromkovic: Theoretical Computer Science. Springer 2004. Further reading: 3. M. Sipser: Introduction to the Theory of Computation, PWS Publ. Comp.1997 4. J.E. Hopcroft, R. Motwani, J.D. Ullman: Introduction to Automata Theory, Languages, and Computation (3rd Edition), Addison-Wesley 2006. 5. I. Wegener: Theoretische Informatik. Teubner. More exercises and examples in: 6. A. Asteroth, Ch. Baier: Theoretische Informatik

Learning Materials (Links)

General Information

Language
German
Levels
BSC
Frequency
Yearly recurring

Examination

Type
session examination
Mode
written 180 minutes
Aids
Keine.
Es finden zwei freiwillige Zwischenklausuren statt. Um zu den Zwischenklausuren zugelassen zu werden, werden jeweils 50 Prozent der Punkte aus den Übungen benötigt bis zu dem jeweiligen Klausurtermin. Aus den beiden Zwischenklausuren wird eine Durchschnittsnote ermittelt (ggf. Rundung auf nächstbessere Viertelnote). Am Ende des Semesters wählt jeder Teilnehmer eine von zwei Möglichkeiten aus: Entweder Übernahme der Note aus den Zwischenklausuren oder Teilnahme an der Sessionsprüfung.

Course Components

Type Title Time & Place Hours
lecture Theoretische Informatik
Vorlesung im HG E7 mit Videoübertragung ins HG E5.
  • Tue 08:15-10:00 (HG E 5)
  • Tue 08:15-10:00 (HG E 7)
  • Fri 08:15-10:00 (HG E 5)
  • Fri 08:15-10:00 (HG E 7)
4 h weekly
exercise Theoretische Informatik
  • Tue 14:15-16:00 (CAB G 57)
  • Tue 14:15-16:00 (CAB G 59)
  • Tue 14:15-16:00 (HG E 22)
  • Tue 14:15-16:00 (LFW B 2)
  • Tue 14:15-16:00 (ML J 37.1)
  • Wed 16:15-18:00 (CAB G 52)
  • Wed 16:15-18:00 (CAB G 59)
  • Wed 16:15-18:00 (CHN D 44)
  • Wed 16:15-18:00 (CHN D 46)
  • Wed 16:15-18:00 (HG D 3.1)
  • Wed 16:15-18:00 (HG E 22)
  • Wed 16:15-18:00 (LEE C 104)
  • Thu 16:15-18:00 (CAB G 51)
  • Thu 16:15-18:00 (CHN D 48)
  • Thu 16:15-18:00 (CHN F 42)
  • Thu 16:15-18:00 (HG D 3.1)
  • Thu 16:15-18:00 (HG D 5.1)
  • Thu 16:15-18:00 (HG D 5.3)
  • Thu 16:15-18:00 (HG E 33.5)
  • Thu 16:15-18:00 (HG F 26.5)
  • Thu 16:15-18:00 (LEE C 104)
2 h weekly

Offered In