Stud.IP Uni Oldenburg
University of Oldenburg
11.12.2023 03:53:26
inf401 - Foundations of Theoretical Computer Science (Course overview)
Department of Computing Science 6 KP
Module components Semester courses Wintersemester 2023/2024 Examination
Hinweise zum Modul
No participant requirement
Examination times
At the end of the lecture period
Module examination
Written or oral exam
Skills to be acquired in this module
Introduction to the theory of automata, formal languages, computability, and complexity
Professional competence
The students:
  • know different classes of languages (e.g. regular and context-free languages)
  • know automata models corresponding to the respective language classes (e.g. finite automata, pushdown automata, Turing machines)
  • construct automata, Turing machines, and grammars for given tasks
  • know equivalent formalisations of the concept of algorithm
  • classify functions as algorithmically computable and problems as algorithmically decidable
  • know and recognize undecidable problems
  • evaluate the complexity of algorithms
  • know problems that are solvable deterministically or nondeterministically in polynomial time
Methodological competence
The students:
  • learn about the power of abstract models of computation
Social competence
The students:
  • work together in small groups to solve problems
  • present solutions to problems to groups of other students
The students:
  • learn persistence in pursuing difficult tasks
  • learn precision in writing down solutions