htw saar Piktogramm
Back to Main Page Choose Module Version:
XML-Code

flag

Theoretical Informatics

Module name (EN):
Name of module in study programme. It should be precise and clear.
Theoretical Informatics
Degree programme:
Study Programme with validity of corresponding study regulations containing this module.
Computer Science and Communication Systems, Bachelor, ASPO 01.10.2017
Module code: KIB-TI
SAP-Submodule-No.:
The exam administration creates a SAP-Submodule-No for every exam type in every module. The SAP-Submodule-No is equal for the same module in different study programs.
P222-0044
Hours per semester week / Teaching method:
The count of hours per week is a combination of lecture (V for German Vorlesung), exercise (U for Übung), practice (P) oder project (PA). For example a course of the form 2V+2U has 2 hours of lecture and 2 hours of exercise per week.
4V (4 hours per week)
ECTS credits:
European Credit Transfer System. Points for successful completion of a course. Each ECTS point represents a workload of 30 hours.
5
Semester: 3
Mandatory course: yes
Language of instruction:
German
Assessment:
Written exam

[updated 19.02.2018]
Applicability / Curricular relevance:
All study programs (with year of the version of study regulations) containing the course.

KIB-TI (P222-0044) Computer Science and Communication Systems, Bachelor, ASPO 01.10.2017 , semester 3, mandatory course
PIB-TI (P221-0041) Applied Informatics, Bachelor, ASPO 01.10.2017 , semester 3, mandatory course
Workload:
Workload of student for successfully completing the course. Each ECTS credit represents 30 working hours. These are the combined effort of face-to-face time, post-processing the subject of the lecture, exercises and preparation for the exam.

The total workload is distributed on the semester (01.04.-30.09. during the summer term, 01.10.-31.03. during the winter term).
60 class hours (= 45 clock hours) over a 15-week period.
The total student study time is 150 hours (equivalent to 5 ECTS credits).
There are therefore 105 hours available for class preparation and follow-up work and exam preparation.
Recommended prerequisites (modules):
None.
Recommended as prerequisite for:
Module coordinator:
Prof. Dr. Thomas Kretschmer
Lecturer: Prof. Dr. Thomas Kretschmer

[updated 27.09.2016]
Learning outcomes:
After successfully completing this module, students will be familiar with the basic terms and concepts of theoretical informatics. They will be familiar with the characteristics of automatic machines and languages and can select and apply suitable theoretical concepts (e. g. finite automaton or pushdown automaton) for practical tasks.


[updated 19.02.2018]
Module content:
Mathematic principles
Regular languages
Finite automata
Nondeterminism
Regular expressions and languages
Context-free languages
Pushdown automata
Context-free grammar
Turing machines and variations
Decidability
Halting problem

[updated 19.02.2018]
Teaching methods/Media:
Board, script, simulation software

[updated 19.02.2018]
Recommended or required reading:
HOPCROFT J.E., ULLMANN J.D., MOTWANI R., Einführung in die Automatentheorie, Formale Sprachen und Komplexitätstheorie, Pearson, 2002
SIPSER Michael: Introduction to the theory of computation, Course Technology, 3rd edition, 2012

[updated 19.02.2018]
Module offered in:
WS 2022/23, WS 2021/22, WS 2020/21, WS 2019/20, WS 2018/19
[Tue Mar 21 11:05:24 CET 2023, CKEY=kti, BKEY=ki2, CID=KIB-TI, LANGUAGE=en, DATE=21.03.2023]