Discrete Mathematical Structures

Name: Discrete Mathematical Structures
Price: 14.12 USD
Availability: InStock
ISBN: 9780130457974

ISBN-10: 0130457973

ISBN-13: 9780130457974

Edition: 5th 2004 (Revised)

Authors: Bernard Kolman, Robert C. Busby, Sharon Cutler Ross

List price: $124.00

30 day, 100% satisfaction guarantee!

Marketplace

2 new & used from $14.12

what's this?

Rush Rewards U
Members Receive:

You have reached 400 XP and carrot coins. That is the daily max!

Description:

Combining a careful selection of topics with coverage of theirgenuineapplications in computer science, this book, more than any other in this field, is clearly and concisely written, presenting the basic ideas of discrete mathematical structures in a manner that is understandable.Limiting its scope and depth of topics to those that readers can actually utilize, this book covers first the fundamentals, then follows with logic, counting, relations and digraphs, functions, order relations and structures, trees, graph theory, semigroups and groups, languages and finite-state machines, and groups and coding.With its comprehensive appendices and index, this book can be an excellent reference work…

Book details

List price: $124.00
Edition: 5th
Copyright year: 2004
Publisher: Prentice Hall PTR
Publication date: 8/29/2003
Binding: Hardcover
Pages: 528
Size: 8.00" wide x 10.00" long x 1.00" tall
Weight: 2.530
Language: English




Fundamentals


Sets and Subsets


Operations on Sets


Sequences


Properties of Integers


Matrices


Mathematical Structures



Logic


Propositions and Logical Operations


Conditional Statements


Methods of Proof


Mathematical Induction



Counting


Permutations


Combinations


Pigeonhole Principle


Elements of Probability


Recurrence Relations



Relations and Digraphs


Product Sets and Partitions


Relations and Digraphs


Paths in Relations and Digraphs


Properties of Relations


Equivalence Relations


Computer Representation of Relations and Digraphs


Operations on Relations


Transitive Closure and Warshall's Algorithm



Functions


Functions


Functions for Computer Science


Growth of Functions


Permutation Functions



Order Relations and Structures


Partially Ordered Sets


Extremal Elements of Partially Ordered Sets


Lattices


Finite Boolean Algebras


Functions on Boolean Algebras


Circuit Design



Trees


Trees


Labeled Trees


Tree Searching


Undirected Trees


Minimal Spanning Trees



Topics in Graph Theory


Graphs


Euler Paths and Circuits


Hamiltonian Paths and Circuits


Transport Networks


Matching Problems


Coloring Graphs



Semigroups and Groups


Binary Operations, Revisited


Semigroups


Products and Quotients of Semigroups


Groups


Products and Quotients of Groups



Languages and Finite-State Machines


Languages


Representations of Special Grammars and Languages


Finite-State Machines


Semigroups, Machines, and Languages


Machines and Regular Languages


Simplification of Machines



Groups and Coding


Coding of Binary Information and Error Detection


Decoding and Error Correction


Public Key Cryptology



Algorithms and Pseudocode



Additional Experiments in Discrete Mathematics


Answers to Odd-Numbered Exercises


Answers to Chapter Tests


Index