Czech

Not applicable.

Acquired knowledge will be utilized in solving problems associated with the use of informatics in managerial decision making.

Secondary school mathematics and informatics.

Not applicable.

The lessons consist of one-hour lecture and two-hour practical seminar. The lecture combines theory with illustrative examples. The practical exercise is concerned on handling numerical tasks.

Conditions for awarding course-unit credits:
- active participation in seminars where the attendance is compulsory,
- completion of two partial written tests marked at least with grade "E",

The exam is written and takes 1 hour:
1. Verbally formulated statements and operations with them
2. Application of laws of propositional calculus.
3. Boolean function .
4. Relations .
5. Basic properties and classification of graphs.
6. Definitions of terms or formulation of properties in the graph theory.
7. Finding the language of grammar.
8. Finding the language of automat and its grammar .
Overall evaluation:
The written part is evaluated by the sum of each task points.
If the student does not reach at least 50 out of 100 points, the entire test is evaluated by "F" (failed).

Mathematical logic - constants, variables, statenaents, logical operations,laws of mathematical logic, Boolean algebras and functions, representation of Boolean functions, applications in logical circuit design.
Relations - relations on a set, properties of relations, equivalence.
Graphs - types of graphs, basic notions of undirected graphs, directed graphs,weighted graphs, Dijkstra algorithm of shortest path.
Languages, grammars, automata- concept of a language and a grammar, Chomsky hierarchy, finite automaton, Kleene characterization.

Not applicable.

The goal of the course is to make students familiar with basic concepts and relations of mathematical logic, relations, graph theory and principles of theory of graphs and automats, with possibilities of their applications in the field.

Attendance at lectures is not checked. Attendance at exercises (seminars) is compulsory and is regularly checked. A student is obliged to give reasons for his/her absence. If the teacher accepts the reason for the absence (which is completely under his/her competence), he/she will decide about the form of compensation for the missed lessons.

Not applicable.

Not applicable.

1) Mezník, I: Diskrétní matematika. FP VUT v Brně v Akademickém nakladatelství CERM, s.r.o. Brno, Brno 2004. ISBN 80-214-2754-X. (CS)

Šlapal, J.: Metody diskrétní matematiky. FSI VUT v Brně, Brno 2001 (CS)
Wiitala, S. A: Discrete Mathematics. McGraw-Hill, New York 1987 (EN)