Discrete Computational Structures

Description

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.

Get the book

Amazon.com

Search the book

eBay.com

Search the book

Other editions

• 

  Discrete Computational Structures

  • 1984
  • 360 pages
  • Paperback
  • Academic Press

Similar books

• 

  Discrete Mathematical Structures for Computer Science

  By Bernard Kolman, Robert C. Busby

  This text has been designed as a complete introduction to discrete mathematics, primarily for computer science majors in either a one or two semester course. The topics addressed are of...

• 

  Discrete Structures, Logic, and Computability

  By James L. Hein

  Discrete Structure, Logic, and Computability introduces the beginning computer science student to some of the fundamental ideas and techniques used by computer scientists today, focusing on discrete structures, logic, and computability.

• 

  Applied Discrete Structures

  By Ken Levasseur, Al Doerr

  ... Lagu • Kendra Lansing • Gregory Lawrence • Pearl Laxague • Kevin Le • Matt LeBlanc • Maxwell Leduc • Ariel Leva • Robert Liana • Tammy Liu • Laura Lucaciu • Andrew Magee • Matthew Malone • Logan Mann • Sam Marquis • Amy Mazzucotelli ...

• 

  Discrete Mathematics: An Open Introduction

  By Oscar Levin

  Note: This is the 3rd edition.

• 

  Algebraic and Discrete Mathematical Methods for Modern Biology

  By Raina Robeva

  This book is appropriate for mathematics courses such as finite mathematics, discrete structures, linear algebra, abstract/modern algebra, graph theory, probability, bioinformatics, statistics, biostatistics, and modeling, as well as for ...

• 

  Discrete Mathematics for Computer Science

  By Gary Haggard, John Schlipf, Sue Whitesides

  An increasing number of computer scientists from diverse areas are using discrete mathematical structures to explain concepts and problems and this mathematics text shows you how to express precise ideas in clear mathematical language.

• 

  Computational Discrete Mathematics: Combinatorics and Graph Theory with Mathematica ®

  By Steven Skiena, Sriram Pemmaraju

  This book was first published in 2003.

• 

  Discrete and Computational Geometry

  By Joseph O'Rourke, Satyan L. Devadoss

  This book covers traditional topics such as convex hulls, triangulations, and Voronoi diagrams, as well as more recent subjects like pseudotriangulations, curve reconstruction, and locked chains.

• 

  Practical Discrete Mathematics: Discover math principles that fuel algorithms for computer science and machine learning with Python

  By Ryan T. White, Archana Tikayat Ray

  This book will help you get up to speed with using discrete math principles to take your computer science skills to a more advanced level.

• 

  Computational Modeling of Masonry Structures Using the Discrete Element Method

  By Gabriele, Milani, Sarhosis

  100 Years of experience in ageing of masonry dams and life-time-based rehabilitation. Paper presented at the 2nd International ... Paper presented at the II International Congress on Dam Maintenance and Rehabilitation, Zaragoza, Spain.