Discrete Mathematics

by: Johnsonbaugh, Richard

Discrete Mathematics

by: Johnsonbaugh, Richard

ISBN 13:
9780131593183
ISBN 10:
0131593188
Edition: 7th
Format: Hardcover
Copyright: 12/29/2007
Publisher: Pearson
Newer Edition

Rent From $11.62

Used From $7.50

List Price $227.08 Save

Rent $11.62

TERM	PRICE	DUE
SEMESTER	$78.69	Dec 15
QUARTER	$11.62	Aug 14
SHORT TERM	$11.04	Jul 28

Added Benefits of Renting

Free Shipping Both Ways
Highlight/Take Notes Like You Own It
Purchase/Extend Before Due Date

Add to Cart

List Price $227.08 Save $219.58

Used $7.50

In Stock Usually Ships in 24 Hours.

We Buy This Book Back!

Included with your book

Free Shipping On Every Order

Add to Cart

Note: Supplemental materials are not guaranteed with Rental or Used book purchases.

Extend or Purchase Your Rental at Any Time

Need to keep your rental past your due date? At any time before your due date you can extend or purchase your rental through your account.

Summary

Focused on helping readers understand and construct proofs and, generally, expanding their mathematical maturity this best-seller is an accessible introduction to discrete mathematics. Takes an algorithmic approach that emphasizes problem-solving techniques. Expands discussion on how to construct proofs and treatment of problem solving. Increases number of examples and exercises throughout. Updates textrs"s Web site athttp://condor.depaul.edu/tilde;rjohnson/dm7th.

Sets and Logic
Sets
Propositions
Conditional Propositions and Logical Equivalence
Arguments and Rules of Inference
Quantifiers
Nested QuantifiersProblem-Solving Corner: Quantifiers
Proofs
Mathematical Systems, Direct Proofs, and Counterexamples
More Methods of ProofProblem-Solving Corner: Proving Some Properties of Real Numbers
Resolution Proofs
Mathematical InductionProblem-Solving Corner: Mathematical Induction
Strong Form of Induction and the Well-Ordering Property Notes Chapter Review Chapter Self-Test Computer Exercises
Functions, Sequences, and Relations
FunctionsProblem-Solving Corner: Functions
Sequences and Strings
Relations
Equivalence RelationsProblem-Solving Corner: Equivalence Relations
Matrices of Relations
Relational Databases
Algorithms
Introduction
Examples of Algorithms
Analysis of AlgorithmsProblem-Solving Corner: Design and Analysis of an Algorithm
Recursive Algorithms
Introduction to Number Theory
Divisors
Representations of Integers and Integer Algorithms
The Euclidean AlgorithmProblem-Solving Corner: Making Postage
The RSA Public-Key Cryptosystem
Counting Methods and the Pigeonhole Principle
Basic PrinciplesProblem-Solving Corner: Counting
Permutations and CombinationsProblem-Solving Corner: Combinations
Generalized Permutations and Combinations
Algorithms for Generating Permutations and Combinations
Introduction to Discrete Probability
Discrete Probability Theory
Binomial Coefficients and Combinatorial Identities
The Pigeonhole Principle
Recurrence Relations
Introduction
Solving Recurrence RelationsProblem-Solving Corner: Recurrence Relations
Applications to the Analysis of Algorithms
Graph Theory
Introduction
Paths and CyclesProblem-Solving Corner: Graphs
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 TreesProblem-Solving Corner: 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
MatchingProblem-Solving Corner: Matching
Boolean Algebras and Combinatorial Circuits
Combinatorial Circuits
Properties of Combinatorial Circuits
Boolean AlgebrasProblem-Solving Corner: 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
Appendix
Matrices
Algebra Review
Pseudocode
References
Hints and Solutions to Selected Exercises
Index
Table of Contents provided by Publisher. All Rights Reserved.

Discrete Mathematics

Discrete Mathematics

9780131593183

0131593188

Summary

Author Biography

Table of Contents

Supplemental Materials

Write a Review

Discrete Mathematics

Discrete Mathematics

9780131593183

0131593188

Summary

Author Biography

Table of Contents

Supplemental Materials

Write a Review

Related Products