Discrete Mathematics

ISBN-10: 0131176862

ISBN-13: 9780131176867

Edition: 6th 2005 (Revised)

List price: $138.20
30 day, 100% satisfaction guarantee

If an item you ordered from TextbookRush does not meet your expectations due to an error on our part, simply fill out a return request and then return it by mail within 30 days of ordering it for a full refund of item cost.

Learn more about our returns policy

Description:

This best-selling book provides an accessible introduction to discrete mathematics through an algorithmic approach that focuses on problem-solving techniques.The book provides complete coverage of: Logic and Proofs; Algorithms; Counting Methods and the Pigeonhole Principle; Recurrence Relations; Graph Theory; Trees; Network Models; Boolean Algebra and Combinatorial Circuits; Automata, Grammars, and Languages; Computational Geometry.For individuals interested in mastering introductory discrete mathematics.
what's this?
Rush Rewards U
Members Receive:
coins
coins
You have reached 400 XP and carrot coins. That is the daily max!
Study Briefs

Limited time offer: Get the first one free! (?)

All the information you need in one place! Each Study Brief is a summary of one specific subject; facts, figures, and explanations to help you learn faster.

Add to cart
Study Briefs
Calculus 1 Online content $4.95 $1.99
Add to cart
Study Briefs
Algebra Online content $4.95 $1.99
Add to cart
Study Briefs
Introduction to Logic Online content $4.95 $1.99
Add to cart
Study Briefs
Business Math Formulas Online content $4.95 $1.99
Customers also bought
Loading
Loading
Loading
Loading
Loading
Loading
Loading
Loading
Loading
Loading

Book details

List price: $138.20
Edition: 6th
Copyright year: 2005
Publisher: Prentice Hall PTR
Binding: Paperback
Pages: 688
Size: 8.50" wide x 11.00" long x 1.25" tall
Weight: 3.740
Language: English

Preface
Logic and Proofs
Propositions
Conditional Propositions and Logical Equivalence
Quantifiers
Proofs
Resolution Proofs
Mathematical Induction
Strong Form of Induction and well ordering Property
The Language of Mathematics
Sets
Functions
Sequences and Strings
Relations
Relations
Relations
Equivalence Relations
Matrices of Relations
Relational Databases
Algorithms
Introduction
Correctness of Algorithms
Analysis of Algorithms
Recursive Algorithms
Introduction to Number Theory
Divisors
Representation of Integers and Integer Algorithims
The Euclidean Algorithm
The RSA Public-Key Cryptosystem
Counting Methods and the Pigeonhole Principle
Basic Principles
Permutations and Combinations
Algorithms for Generating Permutations and Combinations
Introduction to Discrete Probability
Discrete Probability Theory
Generalized Permutations and Combinations
Binomial Coefficients and Combinatorial Identities
The Pigeonhole Principle
Recurrence Relations
Introduction
Solving Recurrence Relations
Applications to the Analysis of Algorithms
Graph Theory
Introduction
Paths and Cycles
Hamiltonian Cycles and the Traveling Salesperson Problem
A Shortest-Path Algorithm
Representations of Graphs
Isomorphisms of Graphs
Planar Graphs
Instant Insanity
Trees
Introduction
Terminology and Characterizations of Trees
Spanning Trees
Minimal Spanning Trees
Binary Trees
Tree Traversals
Decision Trees and the Minimum Time for Sorting
Isomorphisms of Trees
Game Trees
Network Models
Introduction
A Maximal Flow Algorithm
The Max Flow, Min Cut Theorem
Matching
Boolean Algebras and Combinatorial Circuits
Combinatorial Circuits
Properties of Combinatorial Circuits
Boolean Algebras
Boolean Functions and Synthesis of Circuits
Applications
Automata, Grammars, and Languages
Sequential Circuits and Finite-State Machines
Finite-State Automata
Languages and Grammars
Nondeterministic Finite-State Automata
Relationships Between Languages and Automata
Computational Geometry
The Closest-Pair Problem
An Algorithm to Compute the Convex Hull
Appendices
Matrices
Algebra Review
References
Hints and Solutions to Selected Exercises
Index
×
Free shipping on orders over $35*

*A minimum purchase of $35 is required. Shipping is provided via FedEx SmartPost® and FedEx Express Saver®. Average delivery time is 1 – 5 business days, but is not guaranteed in that timeframe. Also allow 1 - 2 days for processing. Free shipping is eligible only in the continental United States and excludes Hawaii, Alaska and Puerto Rico. FedEx service marks used by permission."Marketplace" orders are not eligible for free or discounted shipping.

Learn more about the TextbookRush Marketplace.

×