Research Catalog

Discrete computational structures

Title
Discrete computational structures / Robert R. Korfhage.
Author
Korfhage, Robert R.
Publication
  • New York : Academic Press, [1974]
  • ©1974.

Items in the Library & Off-site

Filter by

1 Item

StatusFormatAccessCall NumberItem Location
TextUse in library QA76.6.K68Off-site

Details

Description
xiii, 381 pages : illustrations; 24 cm.
Summary
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.
Series Statement
Computer science and applied mathematics.
Uniform Title
Computer science and applied mathematics
Subject
  • Computer programming
  • Mathematics > Data processing
  • computer programming
  • Computer programming
  • Mathematics > Data processing
  • Automatentheorie
  • Datenverarbeitung
  • Diskrete Struktur
  • Computer science > Mathematics
  • informatique > mathématiques discrètes
Bibliography (note)
  • Includes bibliographical references.
Contents
Basic forms and operations -- Undirected graphs -- Gorn trees -- Directed graphs -- Formal and natural languages -- Finite groups and computing -- Partial orders and lattices -- Boolean algebras -- The propositional calculus -- Combinatorics -- Systems of distinct representatives -- Discrete probability.
ISBN
  • 0124208509
  • 9780124208506
LCCN
73009432
OCLC
  • ocm00790225
  • 790225
  • SCSB-241806
Owning Institutions
Princeton University Library