Authors:
- 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
Part of the book series: Texts in Computer Science (TCS)
Buy it now
Buying options
Tax calculation will be finalised at checkout
Other ways to access
This is a preview of subscription content, log in via an institution to check for access.
Table of contents (13 chapters)
-
Front Matter
-
Back Matter
About this book
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 many problems, 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.
Authors and Affiliations
-
Voronezh State University, Voronezh, Russia
Sergei Kurgalin, Sergei Borzunov
About the authors
Dr. Sergei Borzunov is an Associate Professor at the same institution.
Bibliographic Information
Book Title: The Discrete Math Workbook
Book Subtitle: A Companion Manual for Practical Study
Authors: Sergei Kurgalin, Sergei Borzunov
Series Title: Texts in Computer Science
DOI: https://doi.org/10.1007/978-3-319-92645-2
Publisher: Springer Cham
eBook Packages: Computer Science, Computer Science (R0)
Copyright Information: Springer Nature Switzerland AG 2018
Softcover ISBN: 978-3-030-06479-2Published: 03 January 2019
eBook ISBN: 978-3-319-92645-2Published: 31 July 2018
Series ISSN: 1868-0941
Series E-ISSN: 1868-095X
Edition Number: 1
Number of Pages: XIII, 485
Number of Illustrations: 80 b/w illustrations, 10 illustrations in colour
Topics: Discrete Mathematics in Computer Science, Algorithm Analysis and Problem Complexity, Discrete Mathematics, The Computing Profession