Theoretical Computer Science
PDF Course Catalog Deutsche Version: THI
Version: 4 | Last Change: 25.01.2020 18:24 | Draft: 0 | Status: vom verantwortlichen Dozent freigegeben
Long name | Theoretical Computer Science |
---|---|
Approving CModule | THI_MaTIN |
Responsible |
Prof. Dr. Hubert Randerath
Professor Fakultät IME |
Valid from | summer semester 2021 |
Level | Master |
Semester in the year | summer semester |
Duration | Semester |
Hours in self-study | 78 |
ECTS | 5 |
Professors |
Prof. Dr. Hubert Randerath
Professor Fakultät IME |
Requirements | Basics in automata theory and formal languages |
Language | German |
Separate final exam | Yes |
Details | oral exam |
---|---|
Minimum standard | Master of basic course topics must be shown |
Exam Type | EN mündliche Prüfung, strukturierte Befragung |
Goal type | Description |
---|---|
Skills | An algorithm's complexity can be determined by analyzing its input and the algorithmic core, e.g., by means of the O-notation. The analysis might consist of a polynomial reduction of a known hard problem like the satisfiability problem in propositional logic of the unknown problem. |
Type | Attendance (h/Wk.) |
---|---|
Lecture | 2 |
Exercises (whole course) | 2 |
Exercises (shared course) | 0 |
Tutorial (voluntary) | 0 |
none |
Accompanying material |
- Theoretische Informatik, J. Hromkovic, Teubner-Verlag - Theoretische Informatik - kurzgefasst, U. Schöning, Spektrum-Verlag - Theoretische Grundlagen der Informatik, R. Solcher, Hanser-Verlag |
---|---|
Separate exam | No |
© 2022 Technische Hochschule Köln