Search for contacts, projects,
courses and publications

Fundamentals of Informatics

Description

COURSE OBJECTIVES

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.

 

COURSE DESCRIPTION
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

 

LEARNING METHODS
The course will contain lectures and practical sessions.

 

EXAMINATION INFORMATION
There will be a written final exam covering the material of the course. It will contain theory questions alone with the practical exercises similar to homework assignments.

 

REFERENCES

  • D. Velleman, How to Prove It: A Structured Approach (2nd Ed), Cambridge University Press 1994, 2006 (Required)
  • Michael Sipser, Introduction to the Theory of Computation; MIT Press, Cambridge, USA, second edition, 2006 (Required)
  • Thomas H. Cormen, Clifford Stein, Charles E. Leiserson, Robert L. Rivest. "Introduction to Algorithms". MIT Press, Cambridge, USA, 3rd edition, 2009. (Recommended)

People

 

Sharygina N.

Course director

Blicha M.

Assistant

Additional information

Semester
Fall
Academic year
2020-2021
ECTS
6
Language
English
Education
Master of Science in Economics in Finance, Elective course, Minor in Digital Finance, 2nd year
Master of Science in Management and Informatics, Management track, Lecture, 1st year