Skip to main content
SpringerLink
Log in

The Discrete Math Workbook

A Companion Manual Using Python

  • Textbook
  • © 2020

Overview

Authors:
  1. Sergei Kurgalin

    1. Voronezh State University, Voronezh, Russia

    View author publications

    You can also search for this author in PubMed   Google Scholar

  2. Sergei Borzunov

    1. Voronezh State University, Voronezh, Russia

    View author publications

    You can also search for this author in PubMed   Google Scholar

  • Presents a hands-on, classroom-tested study guide suitable for laboratory practical training and self-study
  • Provides an extensive set of exercises and examples of different levels of complexity
  • Offers detailed solutions to many problems, applying commonly-used methods and computational schemes
  • Updated second edition, now covering the design and analysis of algorithms using Python, and featuring more than 50 new exercises with solutions

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

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 69.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book USD 89.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (13 chapters)

  1. Front Matter

    Pages i-xvii
    Download chapter PDF

  2. Fundamentals of Mathematical Logic

    • Sergei Kurgalin, Sergei Borzunov
    Pages 1-62

  3. Set Theory

    • Sergei Kurgalin, Sergei Borzunov
    Pages 63-101

  4. Relations and Functions

    • Sergei Kurgalin, Sergei Borzunov
    Pages 103-148

  5. Combinatorics

    • Sergei Kurgalin, Sergei Borzunov
    Pages 149-178

  6. Graphs

    • Sergei Kurgalin, Sergei Borzunov
    Pages 179-216

  7. Boolean Algebra

    • Sergei Kurgalin, Sergei Borzunov
    Pages 217-249

  8. Complex Numbers

    • Sergei Kurgalin, Sergei Borzunov
    Pages 251-280

  9. Recurrence Relations

    • Sergei Kurgalin, Sergei Borzunov
    Pages 281-331

  10. Concept of an Algorithm. Correctness of Algorithms

    • Sergei Kurgalin, Sergei Borzunov
    Pages 333-342

  11. Turing Machine

    • Sergei Kurgalin, Sergei Borzunov
    Pages 343-355

  12. Asymptotic Analysis

    • Sergei Kurgalin, Sergei Borzunov
    Pages 357-375

  13. Basic Algorithms

    • Sergei Kurgalin, Sergei Borzunov
    Pages 377-433

  14. Parallel Algorithms

    • Sergei Kurgalin, Sergei Borzunov
    Pages 435-477

  15. Back Matter

    Pages 479-500
    Download chapter PDF
Back to top

Keywords

About this book

This practically-focused study guide introduces the fundamentals of discrete mathematics through an extensive set of classroom-tested problems. Each chapter presents a concise introduction to the relevant theory, followed by a detailed account of common challenges and methods for overcoming these. The reader is then encouraged to practice solving such problems for themselves, by tackling a varied selection of questions and assignments of different levels of complexity.

This updated second edition now covers the design and analysis of algorithms using Python, and features more than 50 new problems, complete with solutions.

Topics and features: provides a substantial collection of problems and examples of varying levels of difficulty, 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 Turing machines, 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 workbook is an invaluable resource for undergraduate students of computer science, informatics, and electronic engineering. Suitable for use in a one- or two-semester course on discrete mathematics, the text emphasizes the skills required to develop and implement an algorithm in a specific programming language.

Reviews

“The content is pretty comprehensive. … The writing is well-done and the text is nicely edited. … it could be very effectively used for self-study. The discovery aspect of problems and solutions can be much more engaging than straight forward reading of text. The reader is also able to build up their knowledge, starting with the problems with short answers and moving to those that are more involved with proofs or longer solutions.” (Tricia Muldoon Brown, MAA Reviews, September 20, 2021)

Authors and Affiliations

  • Voronezh State University, Voronezh, Russia

    Sergei Kurgalin, Sergei Borzunov

About the authors

​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.


Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation