Advertisement

Problems and Exercises in Discrete Mathematics

  • G. P. Gavrilov
  • A. A. Sapozhenko

Part of the Kluwer Texts in the Mathematical Sciences book series (TMS, volume 14)

Table of contents

  1. Front Matter
    Pages i-xi
  2. Problems

    1. Front Matter
      Pages 1-1
    2. G. P. Gavrilov, A. A. Sapozhenko
      Pages 3-37
    3. G. P. Gavrilov, A. A. Sapozhenko
      Pages 38-65
    4. G. P. Gavrilov, A. A. Sapozhenko
      Pages 66-80
    5. G. P. Gavrilov, A. A. Sapozhenko
      Pages 81-109
    6. G. P. Gavrilov, A. A. Sapozhenko
      Pages 110-133
    7. G. P. Gavrilov, A. A. Sapozhenko
      Pages 134-187
    8. G. P. Gavrilov, A. A. Sapozhenko
      Pages 188-213
    9. G. P. Gavrilov, A. A. Sapozhenko
      Pages 214-253
    10. G. P. Gavrilov, A. A. Sapozhenko
      Pages 254-272
    11. G. P. Gavrilov, A. A. Sapozhenko
      Pages 273-293
  3. Answers, Hints, Solutions

    1. Front Matter
      Pages 295-295
    2. G. P. Gavrilov, A. A. Sapozhenko
      Pages 297-302
    3. G. P. Gavrilov, A. A. Sapozhenko
      Pages 303-312
    4. G. P. Gavrilov, A. A. Sapozhenko
      Pages 313-324
    5. G. P. Gavrilov, A. A. Sapozhenko
      Pages 325-328
    6. G. P. Gavrilov, A. A. Sapozhenko
      Pages 329-338
    7. G. P. Gavrilov, A. A. Sapozhenko
      Pages 339-347
    8. G. P. Gavrilov, A. A. Sapozhenko
      Pages 348-352
    9. G. P. Gavrilov, A. A. Sapozhenko
      Pages 353-402
    10. G. P. Gavrilov, A. A. Sapozhenko
      Pages 403-408
    11. G. P. Gavrilov, A. A. Sapozhenko
      Pages 409-414
  4. Back Matter
    Pages 415-423

About this book

Introduction

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.

Keywords

Boolean algebra algebra algorithms automata automata theory coding theory combinatorics discrete mathematics graphs linear optimization mathematics network networks

Authors and affiliations

  • G. P. Gavrilov
    • 1
  • A. A. Sapozhenko
    • 1
  1. 1.Department of Computational Mathematics and CyberneticsMoscow State UniversityMoscowRussia

Bibliographic information

  • DOI https://doi.org/10.1007/978-94-017-2770-9
  • Copyright Information Springer Science+Business Media B.V. 1996
  • Publisher Name Springer, Dordrecht
  • eBook Packages Springer Book Archive
  • Print ISBN 978-90-481-4702-1
  • Online ISBN 978-94-017-2770-9
  • Series Print ISSN 0927-4529
  • Buy this book on publisher's site