|

Addison-Wesley / Prentice Hall

Mathematics

My Instructor Resource Center :  Log in or request access

Discrete Mathematics, 5/E
Richard JohnsonbaughDePaul University

ISBN-10: 0130890081
ISBN-13:  9780130890085

Publisher:  Pearson
Copyright:  2001
Format:  Cloth; 621 pp
Published:  08/23/2000

For one or two term introductory courses in discrete mathematics.

This best-selling book provides an accessible introduction to discrete mathematics through an algorithmic approach that focuses on problem- solving techniques. This edition has woven techniques of proofs into the text as a running theme. Each chapter has a problem-solving corner that shows students how to attack and solve problems.

  • NEW - Expanded emphasis on reading and doing proofs.
    • Helps students develop problem-solving skills. Ex.___

  • NEW - Enhanced logic sections.
    • Provides students with new motivational examples. Ex.___

  • NEW - More exercises and examples—3500 exercises in all, 1/3 with answers and over 500 worked examples.
    • Helps students practice solving problems. Ex.___

  • NEW - New icons and examples referencing World Wide Web links and Web help.
    • Provides students with easy access to supplemental references. Ex.___

  • NEW - Logic Game.
    • Offers students an alternative way to determine whether a quantified propositional function is true or false. Ex.___

  • NEW - Arrow diagrams and graphs of functions added.
    • Offers students a pictorial view of functions. Ex.___

  • NEW - Sections on discrete probability.
  • NEW - Appendix on basic algebra review.
    • Provides students with easy-access to review important mathematical functions. Ex.___

  • NEW - Computer examples and exercises.
    • Helps students connect theory to use of computer. Ex.___

  • NEW - Section Reviews.
    • Provides students with a review of key concepts, definitions and techniques. Ex.___

  • NEW - 650 figures and tables.
    • Improves students understanding by illustrating concepts and showing how algorithms work. Ex.___

  • Hallmark Features.
  • Thorough discussion of algorithms, recursive algorithms, and the analysis of algorithms.
    • Written in pseudocode, algorithms aid comprehension and help to enliven the material and motivate students. Ex.___

  • Significant number of applications, especially applications related to computer science.
    • Helps students to see concepts' practicality. Ex.___

  • Notes sections with suggestions for further reading and reference section.
    • Provides students with up-to-date readings so they can conduct further investigation. Ex.___

  • Problem-solving corners.
    • Helps students solve problems and shows how to do proofs. Ex.___

  • Expanded emphasis on reading and doing proofs.
    • Helps students develop problem-solving skills. Ex.___

  • Enhanced logic sections.
    • Provides students with new motivational examples. Ex.___

  • More exercises and examples—3500 exercises in all, 1/3 with answers and over 500 worked examples.
    • Helps students practice solving problems. Ex.___

  • New icons and examples referencing World Wide Web links and Web help.
    • Provides students with easy access to supplemental references. Ex.___

  • Logic Game.
    • Offers students an alternative way to determine whether a quantified propositional function is true or false. Ex.___

  • Arrow diagrams and graphs of functions added.
    • Offers students a pictorial view of functions. Ex.___

  • Sections on discrete probability.
  • Appendix on basic algebra review.
    • Provides students with easy-access to review important mathematical functions. Ex.___

  • Computer examples and exercises.
    • Helps students connect theory to use of computer. Ex.___

  • Section Reviews.
    • Provides students with a review of key concepts, definitions and techniques. Ex.___

  • 650 figures and tables.
    • Improves students understanding by illustrating concepts and showing how algorithms work. Ex.___

(NOTE: Each chapter concludes with Notes, Chapter Review, Chapter Self-Test, and Computer Exercises.)

1. Logic and Proofs.

Propositions. Conditional Propositions and Logical Equivalence. Quantifiers. Proofs. Resolutions Proofs. Mathematical Induction.



2. The Language of Mathematics.

Sets. Sequences and Strings. Number Systems. Relations. Equivalence Relations. Matrices of Relations. Relational Databases. Functions.



3. Algorithms.

Introduction. Notation for Algorithms. The Euclidean Algorithm. Recursive Algorithms. Complexity of Algorithms. Analysis of the Ruclidean Algorithm. The RSA Public-Key Cryptosystem.



4. Counting Methods and the Pigeonhole Principle.

Basic Principles. Permutations and Combinations. Algorithms for Generating Permutations and Combinations. Introduction to Discrete Probability. Discrete Probability Theory. Generalized Permutations and Combinations. Binomial Coefficients and Combinatorial Identities. The Pigeonhole Principle.



5. Recurrence Relations.

Introduction. Solving Recurrence Relations. Applications to the Analysis of Algorithms.



6. Graph Theory.

Introduction. Paths and Cycles. Hamiltonian Cycles and the Traveling Salesperson Problem. A Shortest-Path Algorithm. Representation of Graphs. Isomorphisms of Graphs. Planar Graphs. Instant Insanity.



7. Trees.

Introduction. Terminology and Characterizations of Trees. Spanning Trees. Minimal Spanning Trees. Binary Trees. Tree Traversals. Decision Trees and the Minimum Time for Sorting. Isomorphisms of Trees. Game Trees.



8. Network Models.

Introduction. A Maximal Flow Algorithm. The Max Flow, Min Cut Theorem. Matching.



9. Boolean Algebra and Combinatorial Circuits.

Combinatorial Circuits. Properties of Combinatorial Circuits. Boolean Algebras. Boolean Functions and Synthesis of Circuits. Applications.



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



11. Computational Geometry.

The Closest-Pair Problem. A Lower Bound for the Closest-Pair Problem. An Algorithm to Compute the Convex Hull.



Appendix A: Matrices.


Appendix B: Algebra Review.


References.


Hints and Solutions to Selected Exercises.


Index.

  • 9780131593183
    Discrete Mathematics, 7/E
    Johnsonbaugh
    ©2009 | Pearson | Cloth; 792 pp | Instock
    ISBN-10: 0131593188 | ISBN-13: 9780131593183
    Brief Description

Richard Johnsonbaugh has a Ph.D. from the University of Oregon. He is professor of Computer Science and Information Systems, at DePaul University. He has 25 years of experience in teaching and research, including programming in general and in the C language. Dr. Johnsonbaugh specializes in programming languages, compilers, data structures, and pattern recognition. He is the author of two very successful books on Discrete Mathematics.

Companion Website-Johnsonbaugh, 5/E
Johnsonbaugh
©2001 | Pearson | On-line Supplement; 0 pp | Instock
ISBN-10: 0130897965 | ISBN-13: 9780130897961


Companion Website-Johnsonbaugh, 5/E
Johnsonbaugh
©2001 | Pearson | On-line Supplement; 0 pp | Instock
ISBN-10: 0130897965 | ISBN-13: 9780130897961


Companion Website-Johnsonbaugh, 5/E
Johnsonbaugh
©2001 | Pearson | On-line Supplement; 0 pp | Instock
ISBN-10: 0130897965 | ISBN-13: 9780130897961


For Discrete Math

Discrete Math Workbook: Interactive Exercises
Bush
©2003 | Pearson | Paper; 404 pp | Instock
ISBN-10: 0130463272 | ISBN-13: 9780130463272


Practice Problems in Discrete Mathematics
Obrenic
©2003 | Pearson | Paper; 275 pp | Instock
ISBN-10: 0130458031 | ISBN-13: 9780130458032


For the Mathematics Discipline

Addison-Wesley's Algebra Review
Addison-Wesley
©2004 | Pearson | Paper | Instock
ISBN-10: 0321247086 | ISBN-13: 9780321247087


Addison-Wesley's Basic Math Review
Addison-Wesley
©2004 | Pearson | Paper | Instock
ISBN-10: 0321247078 | ISBN-13: 9780321247070


Algebra Review Study Card, 2/E
D'Ippolito & Generazzo
©2006 | Pearson | Study Card; 6 pp | Instock
ISBN-10: 0321394739 | ISBN-13: 9780321394736


Allied Health Study Card, 2/E
Forshier
©2006 | Pearson | Study Card | Instock
ISBN-10: 0321394747 | ISBN-13: 9780321394743


Basic Math Review Card, 2/E
Addison-Wesley
©2006 | Pearson | Study Card; 6 pp | Instock
ISBN-10: 0321394763 | ISBN-13: 9780321394767


Concept Videos: Algebra
Addison-Wesley
©2008 | Pearson | Multiple Media Package | Instock
ISBN-10: 0321517199 | ISBN-13: 9780321517197


Concept Videos: Basic Math & Prealgebra
Addison-Wesley
©2008 | Pearson | Multiple Media Package | Instock
ISBN-10: 032151758X | ISBN-13: 9780321517586


Discovering Algebra: Examples with Keystrokes on the TI-83/TI-82 and TI-85/TI-86, A Laboratory Approach
Pirich & Bigliani
©1997 | Pearson | Paper; 195 pp | Instock
ISBN-10: 0136492037 | ISBN-13: 9780136492030


Finite Mathematics Study Card
Addison-Wesley
©2006 | Pearson | Study Card | Instock
ISBN-10: 0321374398 | ISBN-13: 9780321374394


Flash Review Series: Algebra
Becker
©2004 | Pearson | Paper | Instock
ISBN-10: 0321143094 | ISBN-13: 9780321143099


Graphing Calculator Reference Card, 3/E
Ripley
©2006 | Pearson | Study Card; 6 pp | Instock
ISBN-10: 0321394755 | ISBN-13: 9780321394750


Graphing Calculator Tutorial CD
Addison-Wesley
©2006 | Pearson | CD-ROM Only | Instock
ISBN-10: 0321357744 | ISBN-13: 9780321357748


Math for Allied Health Study/Reference Card
Forshier
©2006 | Pearson | Study Card; 0 pp | Out of Stock
ISBN-10: 0321336542 | ISBN-13: 9780321336545


Mathematics Spanish Glossary, 2/E
Lara & Peeples
©2000 | Pearson | Paper; 48 pp | Instock
ISBN-10: 0201728966 | ISBN-13: 9780201728965


Overcoming Math Anxiety, 2/E
Davidson & Levitov
©2000 | Pearson | Paper | Instock
ISBN-10: 0321069188 | ISBN-13: 9780321069184


Pearson TI Rebate Coupon $15, 2/E
Pearson
©2009 | Pearson | Paper | Instock
ISBN-10: 0321566041 | ISBN-13: 9780321566041


Prealgebra Review Workbook
Wheel
©2006 | Pearson | Paper; 300 pp | Instock
ISBN-10: 0321473329 | ISBN-13: 9780321473325


Review of Algebra, A
Howard
©2002 | Pearson | Paper; 224 pp | Instock
ISBN-10: 0201773473 | ISBN-13: 9780201773477


Saleable Technology Bundle, 2/E
Pearson
©2009 | Pearson | Multiple Media Package | Estimated Availability : 09/01/2008
ISBN-10: 0321561880 | ISBN-13: 9780321561886


Spanish Basic Math Study Card
Leonarte
©2007 | Pearson | Study Card | Instock
ISBN-10: 0321438582 | ISBN-13: 9780321438584


Stand-alone Access Code Tutor Center
Addison-Wesley
©2008 | Pearson | Access Code Card | Instock
ISBN-10: 0201721708 | ISBN-13: 9780201721706


Companion Website-Johnsonbaugh, 5/E
Johnsonbaugh
©2001 | Pearson | On-line Supplement; 0 pp | Instock
ISBN-10: 0130897965 | ISBN-13: 9780130897961


Pearson Higher Education offers special pricing when you choose to package your text with other student resources. If you're interested in creating a cost-saving package for your students contact your Pearson Higher Education representative.