Discrete Mathematics for Programmers

The fundamental introduction to discrete mathematics, without knowledge of which it is impossible to successfully engage in computer science and programming. None of the numerous publications on this discipline, published in Russian, is not read with such pleasure and benefit. In an affordable and very exciting form, the author talks about the fundamental concepts of discrete mathematics - about logic, sets, graphs, relationships and boolean functions. The theory is summarized and illustrated by numerous simple examples, which makes it an accessible even to a schoolboy. After each chapter (starting from the second), the application described methods for computer science is considered.
Supplements in the publication in Russian are devoted to the topical tasks of the theory of graphs, recursive algorithms, the general problem of extinguishing and the tasks of numerical programming.
The book will be useful to students learning a course of discrete mathematics, and
Also everyone to penetrate the technique of writing and verifying correctness
Algorithms, including practitioners