![[Translate to Englisch:] uni](/fileadmin/_processed_/3/e/csm_2016_Campus_SheilaWerner__14__fb91dbfca5.jpg)
About the structure of our teaching offerings
Bachelor teaching
We offer the Discrete Structures course in the winter semester and the Automata and Formal Languages course in the summer semester. Discrete Structures forms a module together with Elementary Logic, for which there is a joint final examination. Likewise, Automata and Formal Languages and Computability and Complexity form a module with a common final examination. At the beginning of each winter semester, and occasionally also in the summer semester, we offer a preliminary course. The sample study plan for computer science students, Bachelor, looks like this, with a distinction made between the winter and summer semesters depending on the start of the course.
| Start to winter semester | Start to summer semester | |
|---|---|---|
Premliminary course | Formal foundations of Computer Science | (Basic concepts of theoretical computer science) |
semester 1 | Discrete Structures | Elementary Logic |
semester 2 | Elementary Logic | Discrete Structures |
semester 3 | Automata and formal languages | |
semester 4 | Automata and formal languages | Predictability and Complexity |
semester 5 | Predictability and Complexity | |
semester 6 |
This is just a suggestion. In principle, the individual courses can be attended in any order and in any semester. However, it is usually done in the 3rd-5th. There is a certain familiarity with the courses in the semester, which are usually held in the 1st - 2nd. Mathematical speaking skills acquired in the semester are required.
Master teaching
We offer most events on a two-year cycle (starting in even years):
winter semester | Complexity theory A | approximate Algorithms | ||
|---|---|---|---|---|
summer semester | Formal Language A | Data- compression | ||
| following winter semester | Complexity theory B | parameterized Algorithms | ||
| following summer semester | Formal Language B | Lerning algorithms |
The events seemingly “numbered” with A and B do not build directly on each other. As a rule, the A event is dedicated to the topic in breadth, whereas the B event goes more in depth. The computability and logic module is also regularly offered; The module Special Chapters in Theoretical Computer Science is available at irregular intervals. More generally speaking, there are various, changing versions of the modules mentioned, as can also be seen in the module descriptions. This also takes into account the changing research interests at the chair. Finally, seminars, research internships and theses are part of our range of courses. Please feel free to ask us more information about this. You can also find out about our current research.