inf401 - Foundations of Theoretical Computer Science (Course overview)
| Department of Computing Science |
6 KP |
|
| Module components |
Semester courses Wintersemester 2023/2024 |
Examination |
|
Lecture
|
-
2.01.401 - Grundlagen der Theoretischen Informatik (V)
- Prof. Dr. Andreas Peter
- Cedric Richter
Tuesday: 14:00 - 16:00, weekly (from 17/10/23), Location: A07 0-030 (Hörsaal G)
Thursday: 14:00 - 16:00, weekly (from 19/10/23), Location: A07 0-030 (Hörsaal G)
Dates on Thursday, 14.12.2023 14:00 - 17:00, Thursday, 08.02.2024, Monday, 25.03.2024 14:00 - 16:00, Location: A07 0-030 (Hörsaal G), A14 1-101 (Hörsaal 1), A14 1-102 (Hörsaal 2)
|
|
|
Exercises
|
|
|
|
Hinweise zum Modul |
| Prerequisites |
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
Self-competence
The students:
- learn persistence in pursuing difficult tasks
- learn precision in writing down solutions
|
|
