CART

(0) items

Discrete Mathematics and Its Applications with MathZone,9780073312712
This item qualifies for
FREE SHIPPING!

FREE SHIPPING OVER $59!

Your order must be $59 or more, you must select US Postal Service Shipping as your shipping preference, and the "Group my items into as few shipments as possible" option when you place your order.

Bulk sales, PO's, Marketplace Items, eBooks, Apparel, and DVDs not included.

Discrete Mathematics and Its Applications with MathZone

by
Edition:
6th
ISBN13:

9780073312712

ISBN10:
0073312711
Format:
Hardcover
Pub. Date:
7/27/2006
Publisher(s):
McGraw-Hill Science/Engineering/Math
Includes 2-weeks free access to
step-by-step solutions for this book.
Step-by-Step solutions are actual worked out problems to the questions at the end of each chapter that help you understand your homework and study for your exams. Chegg and eCampus are providing you two weeks absolutely free. 81% of students said using Step-by-Step solutions prepared them for their exams.
List Price: $169.37
More New and Used
from Private Sellers
Starting at $57.19
See Prices

Rent Textbook

We're Sorry
Sold Out

Used Textbook

We're Sorry
Sold Out

eTextbook

We're Sorry
Not Available

New Textbook

We're Sorry
Sold Out

Related Products


  • Discrete Math & Its Apps W/Stu Sol
    Discrete Math & Its Apps W/Stu Sol
  • Discrete Mathematics and Its Applications
    Discrete Mathematics and Its Applications
  • Discrete Mathematics and Its Applications
    Discrete Mathematics and Its Applications
  • Student's Solutions Guide for Discrete Mathematics and Its Applications
    Student's Solutions Guide for Discrete Mathematics and Its Applications
  • Student's Solutions Guide to accompany Discrete Mathematics and Its Applications
    Student's Solutions Guide to accompany Discrete Mathematics and Its Applications




Summary

Discrete Mathematics and its Applications, Sixth Edition, is intended for one- or two-term introductory discrete mathematics courses taken by students from a wide variety of majors, including computer science, mathematics, and engineering. This renowned best-selling text, which has been used at over 500 institutions around the world, gives a focused introduction to the primary themes in a discrete mathematics course and demonstrates the relevance and practicality of discrete mathematics to a wide a wide variety of real-world applications...from computer science to data networking, to psychology, to chemistry, to engineering, to linguistics, to biology, to business, and to many other important fields.

Table of Contents

Preface
The MathZone Companion Website To the Student
The Foundations: Logic and Proofs
Propositional Logic
Propositional Equivalences
Predicates and Quantifiers
Nested Quantifiers
Rules of Inference
Introduction to Proofs
Proof Methods and Strategy End-of-Chapter Material
Basic Structures: Sets, Functions, Sequences and Sums
Sets
Set Operations
Functions
Sequences and Summations End-of-Chapter Material
The Fundamentals: Algorithms, the Integers, and Matrices
Algorithms
The Growth of Functions
Complexity of Algorithms
The Integers and Division
Primes and Greatest Common Divisors
Integers and Algorithms
Applications of Number Theory
Matrices End-of-Chapter Material
Induction and Recursion
Mathematical Induction
Strong Induction and Well-Ordering
Recursive Definitions and Structural Induction
Recursive Algorithms
Program Correctness End-of-Chapter Material
Counting
The Basics of Counting
The Pigeonhole Principle
Permutations and Combinations
Binomial Coefficients
Generalized Permutations and Combinations
Generating Permutations and Combinations End-of-Chapter Material
Discrete Probability
An Introduction to Discrete Probability
Probability Theory
Bayes’ Theorem
Expected Value and Variance End-of-Chapter Material
Advanced Counting Techniques
Recurrence Relations
Solving Linear Recurrence Relations
Divide-and-Conquer Algorithms and Recurrence elations
Generating Functions
Inclusion-Exclusion
Applications of Inclusion-Exclusion End-of-Chapter Material
Relations
Relations and Their Properties
n-ary Relations and Their Applications
Representing Relations
Closures of Relations
Equivalence Relations
Partial Orderings End-of-Chapter Material
Graphs
Graphs and Graph Models
Graph Terminology and Special Types of Graphs
Representing Graphs and Graph Isomorphism
Connectivity
Euler and Hamilton Paths
Shortest-Path Problems
Planar Graphs
Graph Coloring End-of-Chapter Material
Trees
Introduction to Trees
Applications of Trees
Tree Traversal
Spanning Trees
Minimum Spanning Trees End-of-Chapter Material
Boolean Algebra
Boolean Functions
Representing Boolean Functions
Logic Gates
Minimization of Circuits End-of-Chapter Material
Modeling Computation
Languages and Grammars
Finite-State Machines with Output
Finite-State Machines with No Output
Language Recognition
Turing Machines End-of-Chapter Material
Appendixes
Axioms for the Real Numbers and the Positive Integers
Exponential and Logarithmic Functions
Pseudocode Suggested Readings
Answers to Odd-Numbered Exercises
Photo Credits
Index of Biographies
Index
Table of Contents provided by Publisher. All Rights Reserved.


Please wait while the item is added to your cart...