Many years of practical experience in teaching discrete mathematics form
the basis of this text book. Part I contains problems on such topics as
Boolean algebra, k-valued logics, graphs and networks, elements of
coding theory, automata theory, algorithms theory, combinatorics,
Boolean minimization and logical design. The exercises are preceded by
ample theoretical background material. For further study the reader is
referred to the extensive bibliography. Part II follows the same
structure as Part I, and gives helpful hints and solutions.
Audience: This book will be of great value to undergraduate students
of discrete mathematics, whereas the more difficult exercises, which
comprise about one-third of the material, will also appeal to
postgraduates and researchers