Discrete Computational Structures
- 0 %
Der Artikel wird am Ende des Bestellprozesses zum Download zur Verfügung gestellt.

Discrete Computational Structures

 PDF
Sofort lieferbar | Lieferzeit: Sofort lieferbar I
ISBN-13:
9781483264295
Einband:
PDF
Seiten:
396
Autor:
Robert R. Korfhage
eBook Typ:
PDF
eBook Format:
PDF
Kopierschutz:
Adobe DRM [Hard-DRM]
Sprache:
Englisch
Beschreibung:

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, "e;Introduction to Discrete Structures,"e; in the ACM Curriculum 68, as well as for mathematicians or professors of computer engineering and advanced 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, "e;Introduction to Discrete Structures,"e; in the ACM Curriculum 68, as well as for mathematicians or professors of computer engineering and advanced mathematics.

Kunden Rezensionen

Zu diesem Artikel ist noch keine Rezension vorhanden.
Helfen sie anderen Besuchern und verfassen Sie selbst eine Rezension.