Main content
This entry is from Winter semester 2020/21 and might be obsolete. You can find a current equivalent here.
CS 460L — Theoretical Computer Science for Pre-Service-Teachers
(dt. Theoretische Informatik für Lehramt an Gymnasien-Studierende)
Level, degree of commitment | Advanced module, depends on importing study program |
Forms of teaching and learning, workload |
Lecture (4 SWS), recitation classen and seminar (2 SWS), 270 hours (attendance in den Lehrveranstaltungen 90 h, preparation and follow-up inklusive Studienleistungen 150 h, Vorbereitung and Ablegen von Prüfungsleistungen 30 h) |
Credit points, formal requirements |
9 CP Course requirement(s): 1) Exercises and at least 1-3 presentations of individual exercises 2) Presentation, approx. 30 min. in the seminar on school-related topics of the lecture with regard to the implementation in the upper secondary school. The successful completion of at least 40% of the exercises is a prerequisite for admission to the module examination. Examination type: Written examination (120 min.) |
Language, Grading |
German,The grading is done with 0 to 15 points according to the examination regulations for the degree program LAaG Computer Science. In the event of failure, a total of 4 attempts are available for the examination. |
Origin | LAaG Computer Science |
Duration, frequency |
One semester, each winter semester |
Person in charge of the module's outline | Prof. Dr. Christian Komusiewicz |
Contents
- Automata theory and formal languages: grammars and the Chomsky hierarchy, finite automata and regular expressions, context-free grammars and push-down automata, closure properties of formal languages, decidability questions
- Computability: models of computability: Turing, Loop and While-computability, primitive recursion and μ-recursion, Church-Turing thesis; decidability, enumerability, undecidable problems
- Complexity theory: complexity measures; P and NP; reductions and NP-complete problems
Qualification Goals
Competences:
- Scientific working methods (recognition, formulation, problem solving, abstraction),
- Verbal communication skills, free speech in front of an audience and during a discussion,
- Didactic preparation of teaching material.
Qualification goals:
Basic knowledge in core areas of theoretical computer science, in detail:
- Dealing with regular expressions, finite automatons and grammars. Recognizing the possibilities and limitations,
- Understanding formal models of calculation,
- Principal limits of algorithmic computing,
- Limits of efficient problem solving,
- Classification of the concepts and assessment of the possible use in school teaching.
Prerequisites
None. The competences taught in the following modules are recommended: Basic Linear Algebra or Basic Real Analysis.
Applicability
The module can be attended at FB12 in study program(s)
- LAaG Computer Science
When studying LAaG Computer Science, this module must be completed in the study area Advanced Modules.
Recommended Reading
(not specified)
Please note:
This page describes a module according to the latest valid module guide in Winter semester 2020/21. Most rules valid for a module are not covered by the examination regulations and can therefore be updated on a semesterly basis. The following versions are available in the online module guide:
- Winter 2016/17
- Summer 2018
- Winter 2018/19
- Winter 2019/20
- Winter 2020/21
- Summer 2021
- Winter 2021/22
- Winter 2022/23
- Winter 2023/24
The module guide contains all modules, independent of the current event offer. Please compare the current course catalogue in Marvin.
The information in this online module guide was created automatically. Legally binding is only the information in the examination regulations (Prüfungsordnung). If you notice any discrepancies or errors, we would be grateful for any advice.