146112 Theoretical Fundamentals of Computer Science

winter semester 2016/2017 | Last update: 17.11.2016 Place course on memo list
146112
Theoretical Fundamentals of Computer Science
VO 3
4,5
weekly
annually
German

Students

-know fundamental concepts of automata, formal languages, and computability
-understand the relations between these concepts
-are able to understand further theoretical work based on the principles

Propositional logic; automata theory and application; conventional languages; formalizing of languages/grammars; syntax and semantics in languages; computability; Turing-machine; halting problem and decidability; complexity of algorithms; p_ and NP-classes; procedures for solving NP problems;

Lecture, assessment is based on a single examination at the end of the course.

Course examination according to § 7, statute section on "study-law regulations"

R. Socher, Theoretische Grundlagen der Informatik, Hanser, 2007
J.E. Hopcroft, R. Motwani, J.D. Ullman: Einführung in die Automatentheorie, formale Sprachen und Komplexitätstheorie, Pearson, 2002
K.W.Wagner, Theoretische Informatik, Springer, 2003
R.Winter, Theoretische Informatik, Oldenbourg, 2002

not applicable

written exam 90 min

17.10.2016
Group 0
Date Time Location
Mon 2016-10-17
13.15 - 16.45 UMIT UMIT SR105
Mon 2016-10-24
13.15 - 16.45 UMIT UMIT SR105
Mon 2016-11-07
13.15 - 16.45 UMIT UMIT SR107
Mon 2016-11-21
13.15 - 16.45 UMIT UMIT SR107
Mon 2016-11-28
13.15 - 16.45 UMIT UMIT SR105
Mon 2016-12-05
13.15 - 16.45 UMIT UMIT SR107
Mon 2016-12-12
13.15 - 16.45 UMIT UMIT SR107
Mon 2016-12-19
13.15 - 16.45 UMIT UMIT SR107
Mon 2017-01-09
13.15 - 16.45 UMIT UMIT SR107
Mon 2017-01-16
13.15 - 16.45 UMIT UMIT SR107
Mon 2017-01-23
13.15 - 16.45 UMIT UMIT SR108