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
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.
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.
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
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.
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.
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)
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.
Über den Autor
¿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.
Inhaltsverzeichnis
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
Klappentext
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.
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
