Problems and Exercises in Discrete Mathematics / Edition 1

by G.P. Gavrilov, A.A. Sapozhenko

Overview

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.

Product Details

ISBN-13:	9789048147021
Publisher:	Springer Netherlands
Publication date:	12/10/2010
Series:	Texts in the Mathematical Sciences , #14
Edition description:	Softcover reprint of hardcover 1st ed. 1996
Pages:	424
Product dimensions:	6.10(w) x 9.25(h) x 0.04(d)

Table of Contents

I Problems.- 1 Representations of Boolean Functions.- 2 Closed Classes and Completeness in Boolean Algebra.- 3 Many-Valued Logics.- 4 Graphs and Networks.- 5 Elements of Coding Theory.- 6 Finite Automata.- 7 Elements of Algorithm Theory.- 8 Combinatorics.- 9 Boolean Minimization.- 10 Logical Design.- II Answers, Hints, Solutions.- 1 Representations of Boolean Functions.- 2 Closed Classes and Completeness in Boolean Algebra.- 3 Many-Valued Logics.- 4 Graphs and Networks.- 5 Elements of Coding Theory.- 6 Finite Automata.- 7 Elements of Algorithm Theory.- 8 Combinatorics.- 9 Boolean Minimization.- 10 Logical Design.

Editorial Reviews

Most of the problems are at an undergraduate level, but about a third are suitable for graduates and researchers in discrete mathematics. The chapters are topical rather than progressive; among them are Boolean algebra, kappa-valued logics, graphs and networks, elements of coding theory, automata theory, algorithms theory, combinatorics, Boolian minimization, and logical design. Some of the problems are from mathematical folklore, but most have been created over the years for seminars and examination. Yes, answers, hints, and solutions are included. First published in 1974 by Moscow State U. Publishing House, and here translated from the 1977 second edition published by Nauka. Annotation c. Book News, Inc., Portland, OR (booknews.com)

Booknews