LFU:online

Students who have completed this module should understand the topics covered in the lecture, and be able to express and apply them. They know the notations of discrete mathematics and can solve problems of discrete mathematics by algorithms.

 Elementary counting problems, graph theory and graph algorithms, finite projective plane, elementary probability method, combinatorial applications of linear algebra.

Lecture, assessment is based on a single examination at the end of the course.

Course examination according to § 7, statute section on "study-law regulations".

Matousek, Nesetril, Invitation to Discrete Mathematics, Oxford 2009