Ship-Ship-Hooray! Free Shipping on $25+ Details >

by Bernard Kolman, Robert Busby and Sharon Ross

Cover type: HardbackEdition: 5TH 04

Copyright: 2004

Publisher: Prentice Hall, Inc.

Published: 2004

International: No

List price: $130.75

All of our used books are 100% hand-inspected and guaranteed! Happy you, happy us.

FREE Shipping on $25+

Order $25 or more and the shipping's on us. Marketplace items and other exclusions apply.

Ships Today!

Order by noon CST (Mon-Fri, excluding holidays). Some restrictions apply.

Easy 30-Day Returns

Not the right book for you? We accept returns within 30 days of purchase. Access codes are non-refundable once revealed or redeemed.

Ships directly from us

You Save $32.75 (25%)

$98.00

Condition: Very Good
**100% Satisfaction Guarantee**

We hand-inspect every one of our used books.

We hand-inspect every one of our used books.

This title is currently not available in digital format.

Well, that's no good. Unfortunately, this edition is currently out of stock. Please check back soon.

Also available in the Marketplace starting at $98.03

Price | Condition | Seller | Comments |
---|

This value-added package contains:

Discrete Mathematical Structures,

Discrete Mathematics Workbook of Interactive Exercises.

A savings of $30!

**1. Fundamentals.**

Sets and Subsets.

Operations on Sets.

Sequences.

Properties of Integers.

Matrices.

Mathematical Structures.

**2. Logic.**

Propositions and Logical Operations.

Conditional Statements.

Methods of Proof.

Mathematical Induction.

**3. Counting.**

Permutations.

Combinations.

Pigeonhole Principle.

Elements of Probability.

Recurrence Relations.

**4. 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.

**5. Functions.**

Functions.

Functions for Computer Science.

Growth of Functions.

Permutation Functions.

**6. Order Relations and Structures.**

Partially Ordered Sets.

Extremal Elements of Partially Ordered Sets.

Lattices.

Finite Boolean Algebras.

Functions on Boolean Algebras.

Circuit Design.

**7. Trees.**

Trees.

Labeled Trees.

Tree Searching.

Undirected Trees.

Minimal Spanning Trees.

**8. Topics in Graph Theory.**

Graphs.

Euler Paths and Circuits.

Hamiltonian Paths and Circuits.

Transport Networks.

Matching Problems.

Coloring Graphs.

**9. Semigroups and Groups.**

Binary Operations, Revisited.

Semigroups.

Products and Quotients of Semigroups.

Groups.

Products and Quotients of Groups.

**10. 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.

**11. Groups and Coding.**

Coding of Binary Information and Error Detection.

Decoding and Error Correction.

Public Key Cryptology.

Appendix A: Algorithms and Pseudocode.

Appendix B: Additional Experiments in Discrete Mathematics.

Answers to Odd-Numbered Exercises.

Answers to Chapter Tests.

Index.

shop us with confidence

Summary

This value-added package contains:

Discrete Mathematical Structures,

Discrete Mathematics Workbook of Interactive Exercises.

A savings of $30!

Table of Contents

**1. Fundamentals.**

Sets and Subsets.

Operations on Sets.

Sequences.

Properties of Integers.

Matrices.

Mathematical Structures.

**2. Logic.**

Propositions and Logical Operations.

Conditional Statements.

Methods of Proof.

Mathematical Induction.

**3. Counting.**

Permutations.

Combinations.

Pigeonhole Principle.

Elements of Probability.

Recurrence Relations.

**4. 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.

**5. Functions.**

Functions.

Functions for Computer Science.

Growth of Functions.

Permutation Functions.

**6. Order Relations and Structures.**

Partially Ordered Sets.

Extremal Elements of Partially Ordered Sets.

Lattices.

Finite Boolean Algebras.

Functions on Boolean Algebras.

Circuit Design.

**7. Trees.**

Trees.

Labeled Trees.

Tree Searching.

Undirected Trees.

Minimal Spanning Trees.

**8. Topics in Graph Theory.**

Graphs.

Euler Paths and Circuits.

Hamiltonian Paths and Circuits.

Transport Networks.

Matching Problems.

Coloring Graphs.

**9. Semigroups and Groups.**

Binary Operations, Revisited.

Semigroups.

Products and Quotients of Semigroups.

Groups.

Products and Quotients of Groups.

**10. 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.

**11. Groups and Coding.**

Coding of Binary Information and Error Detection.

Decoding and Error Correction.

Public Key Cryptology.

Appendix A: Algorithms and Pseudocode.

Appendix B: Additional Experiments in Discrete Mathematics.

Answers to Odd-Numbered Exercises.

Answers to Chapter Tests.

Index.

Publisher Info

Publisher: Prentice Hall, Inc.

Published: 2004

International: No

Published: 2004

International: No

Discrete Mathematical Structures,

Discrete Mathematics Workbook of Interactive Exercises.

A savings of $30!

**1. Fundamentals.**

Sets and Subsets.

Operations on Sets.

Sequences.

Properties of Integers.

Matrices.

Mathematical Structures.

**2. Logic.**

Propositions and Logical Operations.

Conditional Statements.

Methods of Proof.

Mathematical Induction.

**3. Counting.**

Permutations.

Combinations.

Pigeonhole Principle.

Elements of Probability.

Recurrence Relations.

**4. 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.

**5. Functions.**

Functions.

Functions for Computer Science.

Growth of Functions.

Permutation Functions.

**6. Order Relations and Structures.**

Partially Ordered Sets.

Extremal Elements of Partially Ordered Sets.

Lattices.

Finite Boolean Algebras.

Functions on Boolean Algebras.

Circuit Design.

**7. Trees.**

Trees.

Labeled Trees.

Tree Searching.

Undirected Trees.

Minimal Spanning Trees.

**8. Topics in Graph Theory.**

Graphs.

Euler Paths and Circuits.

Hamiltonian Paths and Circuits.

Transport Networks.

Matching Problems.

Coloring Graphs.

**9. Semigroups and Groups.**

Binary Operations, Revisited.

Semigroups.

Products and Quotients of Semigroups.

Groups.

Products and Quotients of Groups.

**10. 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.

**11. Groups and Coding.**

Coding of Binary Information and Error Detection.

Decoding and Error Correction.

Public Key Cryptology.

Appendix A: Algorithms and Pseudocode.

Appendix B: Additional Experiments in Discrete Mathematics.

Answers to Odd-Numbered Exercises.

Answers to Chapter Tests.

Index.