htw saar QR-encoded URL
Back to Main Page Choose Module Version:
XML-Code

flag


Theoretical Informatics Seminar

Module name (EN):
Name of module in study programme. It should be precise and clear.
Theoretical Informatics Seminar
Degree programme:
Study Programme with validity of corresponding study regulations containing this module.
Computer Science, Master, ASPO 01.10.2018
Module code: DFI-STI
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.
P610-0285
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.
6
Semester: 2
Mandatory course: yes
Language of instruction:
German
Assessment:
Practice talk, talk


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

DFI-STI (P610-0285) Computer Science, Master, ASPO 01.10.2018 , semester 2, mandatory course
KI848 Computer Science and Communication Systems, Master, ASPO 01.04.2016 , semester 2, optional course, informatics specific
KIM-STI (P221-0058) Computer Science and Communication Systems, Master, ASPO 01.10.2017 , semester 2, optional course, informatics specific
PIM-STI (P221-0058) Applied Informatics, Master, ASPO 01.10.2011 , semester 2, mandatory course
PIM-STI (P221-0058) Applied Informatics, Master, ASPO 01.10.2017 , semester 2, 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 180 hours (equivalent to 6 ECTS credits).
There are therefore 135 hours available for class preparation and follow-up work and exam preparation.
Recommended prerequisites (modules):
None.
Recommended as prerequisite for:
Module coordinator:
Prof. Dr. Maximilian Altmeyer
Lecturer: Prof. Dr. Maximilian Altmeyer

[updated 09.08.2020]
Learning outcomes:
After successfully completing this module, students will be able to independently analyze, prepare and present the content of a challenging scientific topic pertaining to theoretical computer science in an understandable way within a given period of time. In addition, they will be able to participate actively in a technical discussion and concisely summarize the lectures they have heard.


[updated 24.02.2018]
Module content:
Advanced topics pertaining to the computability theory, complexity theory and algorithms, e. g. probabilistic algorithms, alternating automata, zero-knowledge proofs, approximation algorithms.

[updated 24.02.2018]
Teaching methods/Media:
Practice talk, talk by student, discussion, summary by listeners

[updated 24.02.2018]
Recommended or required reading:
Berstel, Boasson, Carton, Fagnot: Minimization of automata,  http://arxiv.org/abs/1010.5318
Berstel, Perrin, Reutenauer: Codes and Automata, Cambridge University Press 2010.
Cormen, Leiserson, Rivest: Introduction to Algorithms, The MIT Press 1997.
Hopcroft, Ullman: Ullman: Einführung in die Automatentheorie, Formale Sprachen und Komplexitätstheorie, Addison-Wesley, 1994.
Moore, Christopher; Mertens, Stefan: The Nature of Computation, Oxford University Press 2011.
Motwani, Rajeev; Raghavan, Prabhakar: Randomized Algorithms, Cambridge University Press 2007.
Sipser: Introduction to the Theory of Computation, Second Edition, Thomson 2006.
Vazirani, Vijay: Approximation Algorithms, Springer 2003.
and other articles


[updated 24.02.2018]
 
[Sat Dec 28 10:40:05 CET 2024, CKEY=psti, BKEY=dim, CID=DFI-STI, LANGUAGE=en, DATE=28.12.2024]