
- 396 pages
- English
- PDF
- Available on iOS & Android
Discrete Computational Structures
About this book
Discrete Computational Structures describes discrete mathematical concepts that are important to computing, covering necessary mathematical fundamentals, computer representation of sets, graph theory, storage minimization, and bandwidth. The book also explains conceptual framework (Gorn trees, searching, subroutines) and directed graphs (flowcharts, critical paths, information network). The text discusses algebra particularly as it applies to concentrates on semigroups, groups, lattices, propositional calculus, including a new tabular method of Boolean function minimization. The text emphasizes combinatorics and probability. Examples show different techniques of the general process of enumerating objects. Combinatorics cover permutations, enumerators for combinations, Stirling numbers, cycle classes of permutations, partitions, and compositions. The book cites as example the interplay between discrete mathematics and computing using a system of distinct representatives (SDR) problem. The problem, originating from group theory, graph theory, and set theory can be worked out by the student with a network model involving computers to generate and analyze different scenarios. The book is intended for sophomore or junior level, corresponding to the course B3, "Introduction to Discrete Structures, " in the ACM Curriculum 68, as well as for mathematicians or professors of computer engineering and advanced mathematics.
Tools to learn more effectively

Saving Books

Keyword Search

Annotating Text

Listen to it instead
Information
Table of contents
- Front Cover
- Discrete Computational Structures
- Copyright Page
- Table of Contents
- Preface
- Acknowledgments
- Chapter 1. Basic Forms and Operations
- Chapter 2. Undirected Graphs
- Chapter 3. Gorn Trees
- Chapter 4. Directed Graphs
- Chapter 5. Formal and Natural Languages
- Chapter 6. Finite Groups and Computing
- Chapter 7. Partial Orders and Lattices
- Chapter 8. Boolean Algebras
- Chapter 9. The Propositional Calculus
- Chapter 10. Combinatorics
- Chapter 11. Systems of Distinct Representatives
- Chapter 12. Discrete Probability
- Answers and Hints for Selected Exercises
- Index
- Computer Science and Applied Mathematics
Frequently asked questions
- Essential is ideal for learners and professionals who enjoy exploring a wide range of subjects. Access the Essential Library with 800,000+ trusted titles and best-sellers across business, personal growth, and the humanities. Includes unlimited reading time and Standard Read Aloud voice.
- Complete: Perfect for advanced learners and researchers needing full, unrestricted access. Unlock 1.4M+ books across hundreds of subjects, including academic and specialized titles. The Complete Plan also includes advanced features like Premium Read Aloud and Research Assistant.
Please note we cannot support devices running on iOS 13 and Android 7 or earlier. Learn more about using the app