Discrete Mathematics by R. Johnsonbaugh

Select Discounts Shop
(5021)
Seller's other items
Contact seller
US $23.95
ApproximatelyRM 101.13
Condition:
Good
3 available
Breathe easy. Returns accepted.
Shipping:
US $3.99 (approx RM 16.85) USPS Media MailTM.
Located in: Nashville, TN, United States
Delivery:
Estimated between Wed, 1 Oct and Tue, 7 Oct to 94104
Estimated delivery dates - opens in a new window or tab include seller's handling time, origin ZIP Code, destination ZIP Code and time of acceptance and will depend on shipping service selected and receipt of cleared paymentcleared payment - opens in a new window or tab. Delivery times may vary, especially during peak periods.
Returns:
30 days return. Buyer pays for return shipping. If you use an eBay shipping label, it will be deducted from your refund amount.
Coverage:
Read item description or contact seller for details. See all detailsSee all details on coverage
(Not eligible for eBay purchase protection programmes)

Shop with confidence

Top Rated Plus
Trusted seller, fast shipping, and easy returns. Learn more- Top Rated Plus - opens in a new window or tab
Seller assumes all responsibility for this listing.
eBay item number:295124600799
Last updated on Sep 27, 2025 10:38:16 MYTView all revisionsView all revisions

Item specifics

Condition
Good: A book that has been read but is in good condition. Very minimal damage to the cover including ...
Edition
7
Publish Year
2007
Updated ISBN1
0321964683
Updated ISBN2
9780321964687
ISBN
9780131593183
Category

About this product

Product Identifiers

Publisher
Prentice Hall PTR
ISBN-10
0131593188
ISBN-13
9780131593183
eBay Product ID (ePID)
4430007

Product Key Features

Number of Pages
792 Pages
Publication Name
Discrete Mathematics
Language
English
Publication Year
2007
Subject
General, Discrete Mathematics
Type
Textbook
Subject Area
Mathematics
Author
Richard Johnsonbaugh
Format
Hardcover

Dimensions

Item Height
3.9 in
Item Weight
3.5 Oz
Item Length
3.9 in
Item Width
3.9 in

Additional Product Features

Edition Number
7
Intended Audience
College Audience
LCCN
2011-414417
Dewey Edition
23
Illustrated
Yes
Dewey Decimal
510
Table Of Content
1 Sets and Logic 1.1 Sets 1.2 Propositions 1.3 Conditional Propositions and Logical Equivalence 1.4 Arguments and Rules of Inference 1.5 Quantifiers 1.6 Nested Quantifiers Problem-Solving Corner: Quantifiers 2 Proofs 2.1 Mathematical Systems, Direct Proofs, and Counterexamples 2.2 More Methods of Proof Problem-Solving Corner: Proving Some Properties of Real Numbers 2.3 Resolution Proofs 2.4 Mathematical Induction Problem-Solving Corner: Mathematical Induction 2.5 Strong Form of Induction and the Well-Ordering Property Notes Chapter Review Chapter Self-Test Computer Exercises 3 Functions, Sequences, and Relations 3.1 Functions Problem-Solving Corner: Functions 3.2 Sequences and Strings 3.3 Relations 3.4 Equivalence Relations Problem-Solving Corner: Equivalence Relations 3.5 Matrices of Relations 3.6 Relational Databases 4 Algorithms 4.1 Introduction 4.2 Examples of Algorithms 4.3 Analysis of Algorithms Problem-Solving Corner: Design and Analysis of an Algorithm 4.4 Recursive Algorithms 5 Introduction to Number Theory 5.1 Divisors 5.2 Representations of Integers and Integer Algorithms 5.3 The Euclidean Algorithm Problem-Solving Corner: Making Postage 5.4 The RSA Public-Key Cryptosystem 6 Counting Methods and the Pigeonhole Principle 6.1 Basic Principles Problem-Solving Corner: Counting 6.2 Permutations and Combinations Problem-Solving Corner: Combinations 6.3 Generalized Permutations and Combinations 6.4 Algorithms for Generating Permutations and Combinations 6.5 Introduction to Discrete Probability 6.6 Discrete Probability Theory 6.7 Binomial Coefficients and Combinatorial Identities 6.8 The Pigeonhole Principle 7 Recurrence Relations 7.1 Introduction 7.2 Solving Recurrence Relations Problem-Solving Corner: Recurrence Relations 7.3 Applications to the Analysis of Algorithms 8 Graph Theory 8.1 Introduction 8.2 Paths and Cycles Problem-Solving Corner: Graphs 8.3 Hamiltonian Cycles and the Traveling Salesperson Problem 8.4 A Shortest-Path Algorithm 8.5 Representations of Graphs 8.6 Isomorphisms of Graphs 8.7 Planar Graphs 8.8 Instant Insanity 9 Trees 9.1 Introduction 9.2 Terminology and Characterizations of Trees Problem-Solving Corner: Trees 9.3 Spanning Trees 9.4 Minimal Spanning Trees 9.5 Binary Trees 9.6 Tree Traversals 9.7 Decision Trees and the Minimum Time for Sorting 9.8 Isomorphisms of Trees 9.9 Game Trees 10 Network Models 10.1 Introduction 10.2 A Maximal Flow Algorithm 10.3 The Max Flow, Min Cut Theorem 10.4 Matching Problem-Solving Corner: Matching 11 Boolean Algebras and Combinatorial Circuits 11.1 Combinatorial Circuits 11.2 Properties of Combinatorial Circuits 11.3 Boolean Algebras Problem-Solving Corner: Boolean Algebras 11.4 Boolean Functions and Synthesis of Circuits 11.5 Applications 12 Automata, Grammars, and Languages 12.1 Sequential Circuits and Finite-State Machines 12.2 Finite-State Automata 12.3 Languages and Grammars 12.4 Nondeterministic Finite-State Automata 12.5 Relationships Between Languages and Automata 13 Computational Geometry 13.1 The Closest-Pair Problem 13.2 An Algorithm to Compute the Convex Hull Appendix A Matrices B Algebra Review C Pseudocode References Hints and Solutions to Selected Exercises Index
Synopsis
For a one- or two-term introductory course in discrete mathematics. Focused on helping students understand and construct proofs and expanding their mathematical maturity, this best-selling text is an accessible introduction to discrete mathematics. Johnsonbaugh's algorithmic approach emphasizes problem-solving techniques. The Seventh Edition reflects user and reviewer feedback on both content and organization.
LC Classification Number
QA39.3.J65 2008

Item description from the seller

About this seller

Select Discounts Shop

93.4% positive feedback•37K items sold

Joined Sep 2008
Visit storeContact

Detailed Seller Ratings

Average for the last 12 months
Accurate description
4.7
Reasonable shipping cost
4.7
Shipping speed
4.7
Communication
4.6

Seller feedback (5,500)

All ratings
Positive
Neutral
Negative
See all feedback

More to explore :