FI:M036 Introduction to Discrete Mathe

M036 Introduction to Discrete Mathematics

Faculty of Informatics
Spring 1999

Extent and Intensity

2/2. 4 credit(s). Recommended Type of Completion: zk (examination). Other types of completion: k (colloquium), z (credit).

Teacher(s)

prof. RNDr. Miroslav Novotný, DrSc. (lecturer)

Guaranteed by

Contact Person: prof. RNDr. Miroslav Novotný, DrSc.

Prerequisites (in Czech)

! U100 Úvod do diskrétní matematiky &&! M005 Set Theory I
Předmět není možno zapsat po úspěšném absolvování U100 . Předmět není možno zapsat po úspěšném absolvování M005 Foundations of mathematics.

Course Enrolment Limitations

The course is also offered to the students of the fields other than those the course is directly associated with.

fields of study / plans the course is directly associated with

Syllabus

Sets. Inclusion and operations with sets. Mathematical induction. Relations and mappings and their graphical representation.
Finite sets and their cardinal numbers. Operations with sets and the corresponding operations with natural numbers. Principle of inclusion and exclusion.
Fundamental combinatorial functions. Permutations and combinations. Binomial and polynomial theorem. Ordered partitions.
Finite probability fields.
Principles of mathematical logics. Propositional calculus, elements of predicate logics.
Fundamentals of graph theory. Connected graphs, trees, Eulerian graphs. Planar graphs, colouring of graphs. Elementary graph algorithms. Directed graphs, finite acceptors and automata. Regular sets.

Language of instruction

Czech

Further Comments

The course is taught annually.
The course is taught: every week.

The course is also listed under the following terms Autumn 2001.