Fundamentals of Informatics
The course gives an introduction into the main theoretical topics in Computer Science. Contents: - Mathematical Basis - Propositional Logic - Discrete Mathematics - Algorithmics - Asymptotic Runtime Analysis - Divide-and-Conquer - Finite Automata - Computability - Turing-Machines and Church Thesis - Undecidable Problems - Complexity - P, NP, NP-Complete Complexity classes
The goal of the course is to acquire/refresh basic knowledge on the mathematical basis of Informatics, such as Logic and Discrete Mathematics, as well as of the important notions and concepts of Algorithmics, Computability, and Complexity theory.
The course will contain lectures and practical sessions.
There will be a written final examination