Discrete Mathematics. Study Guide

Five topics are: the theory of sets, Boolean algebra logic, the theory of finite automata, combinatorics and theory of graphs. The theory of sets are highlighted topics: algebra sets, binary relations, infinite sets, theory of fuzzy sets. From the Boolean algebra - minimization of boolean formulas in disjunctive and conjunctive normal forms, taking into account uncertain states, boolean equations, the first information about Boolean differential and integral calculus. From the theory of finite automata - the synthesis of logical (combinational) and multiple schemes, the functional theorem on the functional completeness. From the combinatorics - placement, combinations and rearrangements with repetitions and without repetitions, splitting the sets, etc. From the theory of graphs - graphs and oriented graphs, networks, trees, etc. There are more than 2,600 tasks and exercises for independent work and 620 tasks for test work. All exercises for independent work are answers.

For students of technical specialties of universities and technical schools, schoolchildren of high schools of general education schools and for all those who wish to independently go through the introductory course of applied discrete mathematics