Discrete Computational Structures
eBook - PDF

Discrete Computational Structures

  1. 396 pages
  2. English
  3. PDF
  4. Only available on web
eBook - PDF

Discrete Computational Structures

Book details
Table of contents
Citations

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.

Frequently asked questions

Simply head over to the account section in settings and click on “Cancel Subscription” - it’s as simple as that. After you cancel, your membership will stay active for the remainder of the time you’ve paid for. Learn more here.
At the moment all of our mobile-responsive ePub books are available to download via the app. Most of our PDFs are also available to download and we're working on making the final remaining ones downloadable now. Learn more here.
Both plans give you full access to the library and all of Perlego’s features. The only differences are the price and subscription period: With the annual plan you’ll save around 30% compared to 12 months on the monthly plan.
We are an online textbook subscription service, where you can get access to an entire online library for less than the price of a single book per month. With over 1 million books across 1000+ topics, we’ve got you covered! Learn more here.
Look out for the read-aloud symbol on your next book to see if you can listen to it. The read-aloud tool reads text aloud for you, highlighting the text as it is being read. You can pause it, speed it up and slow it down. Learn more here.
Yes, you can access Discrete Computational Structures by Robert R. Korfhage, Werner Rheinboldt in PDF and/or ePUB format, as well as other popular books in Mathematics & Mathematics General. We have over one million books available in our catalogue for you to explore.

Information

Publisher
Academic Press
Year
2014
ISBN
9781483264295
Topic
Mathematics
Subtopic
Mathematics General
Index
Mathematics

Table of contents

  1. Front Cover
  2. Discrete Computational Structures
  3. Copyright Page
  4. Table of Contents
  5. Preface
  6. Acknowledgments
  7. Chapter 1. Basic Forms and Operations
  8. Chapter 2. Undirected Graphs
  9. Chapter 3. Gorn Trees
  10. Chapter 4. Directed Graphs
  11. Chapter 5. Formal and Natural Languages
  12. Chapter 6. Finite Groups and Computing
  13. Chapter 7. Partial Orders and Lattices
  14. Chapter 8. Boolean Algebras
  15. Chapter 9. The Propositional Calculus
  16. Chapter 10. Combinatorics
  17. Chapter 11. Systems of Distinct Representatives
  18. Chapter 12. Discrete Probability
  19. Answers and Hints for Selected Exercises
  20. Index
  21. Computer Science and Applied Mathematics