252-0057-00L Theoretical Computer Science
Semester | Autumn Semester 2016 |
Lecturers | J. Hromkovic |
Periodicity | yearly recurring course |
Language of instruction | German |
Courses
Number | Title | Hours | Lecturers | |||||||
---|---|---|---|---|---|---|---|---|---|---|
252-0057-00 V | Theoretische Informatik | 4 hrs |
| J. Hromkovic | ||||||
252-0057-00 U | Theoretische Informatik | 2 hrs | J. Hromkovic | |||||||
252-0057-00 A | Theoretische Informatik Project Work, no fixed presence required. | 1 hrs | J. Hromkovic |
Catalogue data
Abstract | Concepts to cope with: a) what can be accomplished in a fully automated fashion (algorithmically solvable) b) How to measure the inherent difficulty of tasks (problems) c) What is randomness and how can it be useful? d) What is nondeterminism and what role does it play in CS? e) How to represent infinite objects by finite automata and grammars? |
Objective | Learning the basic concepts of computer science along their historical development |
Content | This lecture gives an introduction to theoretical computer science, presenting the basic concepts and methods of computer science in its historical context. We present computer science as an interdisciplinary science which, on the one hand, investigates the border between the possible and the impossible and the quantitative laws of information processing, and, on the other hand, designs, analyzes, verifies, and implements computer systems. The main topics of the lecture are: - alphabets, words, languages, measuring the information content of words, representation of algorithmic tasks - finite automata, regular and context-free grammars - Turing machines and computability - complexity theory and NP-completeness - design of algorithms for hard problems |
Lecture notes | The lecture is covered in detail by the textbook "Theoretical Computer Science". |
Literature | Basic literature: 1. J. Hromkovic: Theoretische Informatik. 5th edition, Springer Vieweg 2014. 2. J. Hromkovic: Theoretical Computer Science. Springer 2004. Further reading: 3. M. Sipser: Introduction to the Theory of Computation, PWS Publ. Comp.1997 4. J.E. Hopcroft, R. Motwani, J.D. Ullman: Introduction to Automata Theory, Languages, and Computation (3rd Edition), Addison-Wesley 2006. 5. I. Wegener: Theoretische Informatik. Teubner. More exercises and examples in: 6. A. Asteroth, Ch. Baier: Theoretische Informatik |
Prerequisites / Notice | During the semester, two non-obligatory test exams will be offered. |
Performance assessment
Performance assessment information (valid until the course unit is held again) | |
Performance assessment as a semester course | |
ECTS credits | 8 credits |
Examiners | J. Hromkovic |
Type | session examination |
Language of examination | German |
Repetition | The performance assessment is only offered in the session after the course unit. Repetition only possible after re-enrolling. |
Mode of examination | written 180 minutes |
Additional information on mode of examination | Es finden zwei freiwillige Zwischenklausuren statt. Um zu den Zwischenklausuren zugelassen zu werden, werden jeweils 50 Prozent der Punkte aus den Übungen benötigt bis zu dem jeweiligen Klausurtermin. Aus den beiden Zwischenklausuren wird eine Durchschnittsnote ermittelt (ggf. Rundung auf nächstbessere Viertelnote). Am Ende des Semesters wählt jeder Teilnehmer eine von zwei Möglichkeiten aus: Entweder Übernahme der Note aus den Zwischenklausuren oder Teilnahme an der Sessionsprüfung. |
Written aids | Keine. |
This information can be updated until the beginning of the semester; information on the examination timetable is binding. |
Learning materials
Main link | Information |
Literature | Juraj Hromkovic: Theoretische Informatik, 5. Auflage, Springer Vieweg 2014. |
Only public learning materials are listed. |
Groups
No information on groups available. |
Restrictions
There are no additional restrictions for the registration. |