This collection of problems was compiled for students and teachers at university level educational institutions. It contains problems on Boolean algebra, k-valued logics, the theory of graphs and combinatorics, coding theory, automata theory, and the theory of algorithms. The problems include simple ones for those beginning with discrete mathematics, and more difficult ones that stimulate a better grasp of a subject. The theory of dis­crete mathematics is presented in Introduction to Discrete Math­ematics by S. Yablonsky.G. Gavrilov is an associate professor at the Faculty of Com­putational Mathematics and Cy­bernetics at Moscow State Uni­versity. He has written a series of aids on discrete mathematics and mathematical logic, which have been published by Mos­ cow University Press and Nauka. His scientific interests cover dis­crete functional systems, graph theory, and mathematical logic. A. Sapozhenko is an associate professor in the same depart­ment. He specializes in dis­ crete mathematics and mathe­matical cybernetics. His main scientific interests are associated with the Boolean algebra, the minimization of Boolean func­tions, the random graphs, and the combinatorics of partially ordered sets. Translated from Russian by Ram S. Wadhwa and Natalia V. WadhwaFirst published 1989Revised from the 1977 Russian editionOriginal scan from Servants of Knowledge