Fundamentals of Informatics

The course gives an introduction into the main theoretical topics in Computer Science. The goal of the course is to acquire 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.

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.

REFERENCES

• Thomas H. Cormen, Clifford Stein, Charles E. Leiserson, Robert L. Rivest. "Introduction to Algorithms". MIT Press, Cambridge, USA, 3rd edition, 2009. (Required)
• Introduction to the Theory of Computation; Michael Sipser, 2006, MIT Press, Cambridge, USA, second edition (Required)