What do you think?
Rate this book
The Discrete Math Workbook: A Companion Manual for Practical Study
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 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.
498 pages, Hardcover
Published August 9, 2018
6 people want to read
Ratings & Reviews
Friends & Following
Create a free account to discover what your friends think of this book!
Community Reviews
Displaying 1 of 1 review
May 21, 2019
"...The most detailed and developed material resides in the final chapters on sorting and parallel processing. These chapters cover areas in the theory of computer science through analysis of algorithms presented in pseudocode.
The authors are from Voronezh State University, one of the main universities in Central Russia. Many passages read like improvable translations, such as:
In the case E is the equivalence relation on A, then various equivalence classes form a partition on A…. Partial order on the set A is a reflective, antisymmetric, or transitive relation of P.
Exactly which various classes? So, the partial order is not defined as narrowly as reflexive, anti-symmetric and transitive relation?
...."
[Look for my entire review at MAA Reviews]
The authors are from Voronezh State University, one of the main universities in Central Russia. Many passages read like improvable translations, such as:
In the case E is the equivalence relation on A, then various equivalence classes form a partition on A…. Partial order on the set A is a reflective, antisymmetric, or transitive relation of P.
Exactly which various classes? So, the partial order is not defined as narrowly as reflexive, anti-symmetric and transitive relation?
...."
[Look for my entire review at MAA Reviews]
Displaying 1 of 1 review