Advertisement

The Discrete Math Workbook

A Companion Manual for Practical Study

  • Sergei Kurgalin
  • Sergei Borzunov

Part of the Texts in Computer Science book series (TCS)

Table of contents

  1. Front Matter
    Pages i-xiii
  2. Sergei Kurgalin, Sergei Borzunov
    Pages 1-62
  3. Sergei Kurgalin, Sergei Borzunov
    Pages 63-101
  4. Sergei Kurgalin, Sergei Borzunov
    Pages 103-139
  5. Sergei Kurgalin, Sergei Borzunov
    Pages 141-171
  6. Sergei Kurgalin, Sergei Borzunov
    Pages 173-207
  7. Sergei Kurgalin, Sergei Borzunov
    Pages 209-243
  8. Sergei Kurgalin, Sergei Borzunov
    Pages 245-271
  9. Sergei Kurgalin, Sergei Borzunov
    Pages 273-327
  10. Sergei Kurgalin, Sergei Borzunov
    Pages 329-338
  11. Sergei Kurgalin, Sergei Borzunov
    Pages 339-350
  12. Sergei Kurgalin, Sergei Borzunov
    Pages 351-366
  13. Sergei Kurgalin, Sergei Borzunov
    Pages 367-418
  14. Sergei Kurgalin, Sergei Borzunov
    Pages 419-463
  15. Back Matter
    Pages 465-485

About this book

Introduction

This practically-oriented textbook presents an accessible introduction to discrete mathematics through a substantial collection of classroom-tested exercises. Each chapter opens with concise coverage of the theory underlying the topic, reviewing the basic concepts and establishing the terminology, as well as providing the key formulae and instructions on their use. This is then followed by a detailed account of the most common problems in the area, before the reader is invited to practice solving such problems for themselves through a varied series of questions and assignments.

Topics and features:

  • Provides an extensive set of exercises and examples of varying levels of complexity, suitable for both laboratory practical training and self-study
  • Offers detailed solutions to each problem, applying commonly-used methods and computational schemes
  • Introduces the fundamentals of mathematical logic, the theory of algorithms, Boolean algebra, graph theory, sets, relations, functions, and combinatorics
  • Presents more advanced material on the design and analysis of algorithms, including asymptotic analysis, and parallel algorithms
  • Includes reference lists of trigonometric and finite summation formulae in an appendix, together with basic rules for differential and integral calculus

This hands-on study guide is designed to address the core needs of undergraduate students training in computer science, informatics, and electronic engineering, emphasizing the skills required to develop and implement an algorithm in a specific programming language.

Dr. Sergei Kurgalin is a Professor and Head of the Department of Digital Technologies at Voronezh State University, Russia. Dr. Sergei Borzunov is an Associate Professor at the same institution.

Keywords

Discrete mathematics Algorithm analysis Problem complexity Boolean algebra Set theory

Authors and affiliations

  • Sergei Kurgalin
    • 1
  • Sergei Borzunov
    • 2
  1. 1.Voronezh State UniversityVoronezhRussia
  2. 2.Voronezh State UniversityVoronezhRussia

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-319-92645-2
  • Copyright Information Springer International Publishing AG, part of Springer Nature 2018
  • Publisher Name Springer, Cham
  • eBook Packages Computer Science
  • Print ISBN 978-3-319-92644-5
  • Online ISBN 978-3-319-92645-2
  • Series Print ISSN 1868-0941
  • Series Online ISSN 1868-095X
  • Buy this book on publisher's site
Industry Sectors
IT & Software
Energy, Utilities & Environment
Engineering