Discrete computational structures (Computer science and applied mathematics)

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 Content: Front Matter, Page iii Copyright, Page iv Preface, Pages ix-xi Acknowledgments, Page xiii CHAPTER 1 - Basic Forms and Operations, Pages 1-36 CHAPTER 2 - Undirected Graphs, Pages 37-100 CHAPTER 3 - Gorn Trees, Pages 101-129 CHAPTER 4 - Directed Graphs, Pages 130-165 CHAPTER 5 - Formal and Natural Languages, Pages 166-182 CHAPTER 6 - Finite Groups and Computing, Pages 183-207 CHAPTER 7 - Partial Orders and Lattices, Pages 208-225 CHAPTER 8 - Boolean Algebras, Pages 226-251 CHAPTER 9 - The Propositional Calculus, Pages 252-280 CHAPTER 10 - Combinatorics, Pages 281-311 CHAPTER 11 - Systems of Distinct Representatives, Pages 312-326 CHAPTER 12 - Discrete Probability, Pages 327-355 Answers and Hints for Selected Exercises, Pages 356-374 Index, Pages 375-381 Computer Science and Applied Mathematics: A SERIES OF MONOGRAPHS AND TEXTBOOKS, Page ibc1 Discrete Computational Structures (Computer Science and Applied Mathematics) Hardcover August 27, 1974 by Robert R. Korfhage (Author)