The Discrete Math Workbook

A Companion Manual Using Python

Sergei Kurgalin, sergei borzunov (Autoren)

Buch | Hardcover

XVII, 500 Seiten

2020 | 2nd ed. 2020
Springer International Publishing (Verlag)
978-3-030-42220-2 (ISBN)

Artikel merken

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.

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.

Fundamentals of Mathematical Logic.- Set Theory.- Relations and Functions.- Combinatorics.- Graphs.- Boolean Algebra.- Complex Numbers.- Recurrence Relations.- Concept of an Algorithm, Correctness of Algorithms.- Turing Machine.- Asymptotic Analysis.- Basic Algorithms.- Parallel Algorithms.

"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)

“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)

Erscheinungsdatum	17.08.2020
Reihe/Serie	Texts in Computer Science
Zusatzinfo	XVII, 500 p. 333 illus., 19 illus. in color.
Verlagsort	Cham
Sprache	englisch
Maße	155 x 235 mm
Gewicht	939 g
Themenwelt	Mathematik / Informatik ► Informatik ► Theorie / Studium
Themenwelt	Mathematik / Informatik ► Mathematik
Schlagworte	Algorithm Analysis • Algorithm analysis and problem complexity • Boolean algebra • Discrete Mathematics • problem complexity • set theory
ISBN-10	3-030-42220-8 / 3030422208
ISBN-13	978-3-030-42220-2 / 9783030422202
Zustand	Neuware