Discrete Mathematics and Its Applications

by
Edition: 5th
Format: Paperback
Pub. Date: 2002-09-01
Publisher(s): McGraw-Hill College
  • Free Shipping Icon

    This Item Qualifies for Free Shipping!*

    *Excludes marketplace orders.

List Price: $59.27

Rent Textbook

Select for Price
There was a problem. Please try again later.

New Textbook

We're Sorry
Sold Out

Used Textbook

We're Sorry
Sold Out

eTextbook

We're Sorry
Not Available

How Marketplace Works:

  • This item is offered by an independent seller and not shipped from our warehouse
  • Item details like edition and cover design may differ from our description; see seller's comments before ordering.
  • Sellers much confirm and ship within two business days; otherwise, the order will be cancelled and refunded.
  • Marketplace purchases cannot be returned to eCampus.com. Contact the seller directly for inquiries; if no response within two days, contact customer service.
  • Additional shipping costs apply to Marketplace purchases. Review shipping costs at checkout.

Table of Contents

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
Table of Contents provided by Publisher. All Rights Reserved.

An electronic version of this book is available through VitalSource.

This book is viewable on PC, Mac, iPhone, iPad, iPod Touch, and most smartphones.

By purchasing, you will be able to view this book online, as well as download it, for the chosen number of days.

Digital License

You are licensing a digital product for a set duration. Durations are set forth in the product description, with "Lifetime" typically meaning five (5) years of online access and permanent download to a supported device. All licenses are non-transferable.

More details can be found here.

A downloadable version of this book is available through the eCampus Reader or compatible Adobe readers.

Applications are available on iOS, Android, PC, Mac, and Windows Mobile platforms.

Please view the compatibility matrix prior to purchase.