Discrete Mathematics and Its Applications

ISBN-10: 0072899050
ISBN-13: 9780072899054
Edition: 4th 1999
Authors: Kenneth H. Rosen
List price: $113.75
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

what's this?
Rush Rewards U
Members Receive:
coins
coins
You have reached 400 XP and carrot coins. That is the daily max!
You could win $10,000

Get an entry for every item you buy, rent, or sell.

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: $113.75
Edition: 4th
Copyright year: 1999
Publisher: McGraw-Hill Higher Education
Publication date: 12/11/1998
Binding: Hardcover
Pages: 824
Size: 8.19" wide x 10.12" long x 1.18" tall
Weight: 3.982
Language: English

Discrete Mathematics and Its Applications, Fifth Edition
The Foundations: Logic and Proof, Sets, and Functions
Logic
Propositional Equivalences
Predicates and Quantifiers
Nested Quantifiers
Methods of Proof
Sets
Set Operations
Functions
The Fundamentals: Algorithms, the Integers, and Matrices
Algorithms
The Growth of Functions
Complexity of Algorithms
The Integers and Division
Applications of Number Theory
Matrices
Mathematical Reasoning, Induction, and Recursion
Proof Strategy
Sequences and Summations
Mathematical Induction
Recursive Definitions and Structural Induction
Recursive Algorithms
Program Correctness
Counting
The Basics of Counting
The Pigeonhole Principle
Permutations and Combinations
Binomial Coefficients
Generalized Permutations and Combinations
Generating Permutations and Combinations
Discrete Probability
An Introduction to Discrete Probability
Probability Theory
Expected Value and Variance
Advanced Counting Techniques
Recurrence Relations
Solving Recurrence Relations
Divide-and-Conquer Algorithms and Recurrence Relations
Generating Functions
Inclusion-Exclusion
Applications of Inclusion-Exclusion
Relations
Relations and Their Properties
n-ary Relations and Their Applications
Representing Relations
Closures of Relations
Equivalence Relations
Partial Orderings
Graphs
Introduction to Graphs
Graph Terminology
Representing Graphs and Graph Isomorphism
Connectivity
Euler and Hamilton Paths
Shortest-Path Problems
Planar Graphs
Graph Coloring
Trees
Introduction to Trees
Applications of Trees
Tree Traversal
Spanning Trees
Minimum Spanning Trees
Boolean Algebra
Boolean Functions
Representing Boolean Functions
Logic Gates
Minimization of Circuits
Modeling Computation
Languages and Grammars
Finite-State Machines with Output
Finite-State Machines with No Output
Language Recognition
Turing Machines
Appendixes
Exponential and Logarithmic Functions
Pseudocode

×
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.

×