Foundations of Computer Science (FM 2), Winter Term 2015/16
| Lecturer: | PD Dr. Henning Bordihn |
| Program: | Master of Cognitive Systems |
| SWS: | 4 (2 h/week classroom presence) |
| Credits: | 6 |
| Module: | FM 2 |
Schedule
| Form: Consultation | Time: Thursday, | 18:15-19:45, | 03.04.1.02 | First Meeting: 15.10.15 |
Content
This is a reading course. Video lectures provided in the internet can be used in addition. Details are given in the slides of the Introduction (see below).
The course covers two fundamental topics:
1. Fundamentals of Computing
- Algorithms and their complexity; Growth of functions
- Algorithmic Paradigms (Recursion, Divide and Conquer, Dynamic Programming)
- Fast algorithms (searching, sorting, ...)
2. Theory of Computation
- Finite state automata
- Determinism versus non-determinism
- Regular expressions
- Context-free grammars and pushdown automata
- Turing machines and undecidability
- NP-completeness
Slides and Assignments
Assignment 1: Algorithms and their complexity
Assignment 2: Finite state automata
Assignment 3: Regular expressions
Assignment 4: Context-free grammars
Assignment 5: Pushdown automata and context-free languages
Assignment 6: Turing machines and decidability
Examination
Oral examination (20 minutes), individual.