Discrete Mathematics
5th Edition
Published on 1. September 2000
Book
Hardback
621 pages
978-0-13-089008-5 (ISBN)
Description
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.
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.
More details
Edition
5th edition
Language
English
Place of publication
United States
Publishing group
Pearson Education (US)
Target group
Professional and scholarly
Dimensions
Height: 284 mm
Width: 215 mm
Thickness: 30 mm
Weight
1545 gr
ISBN-13
978-0-13-089008-5 (9780130890085)
Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited or by the publishers or by their respective licensors: all rights reserved.
Schweitzer Classification
Other editions
New editions
Book
09/2004
6th Edition
Pearson
€96.55
Article exhausted; check for reprint
Previous edition
Richard Johnsonbaugh
Discrete Mathematics
Book
10/1996
4th Edition
Prentice Hall
€43.32
Article exhausted; check for reprint
Person
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.
Content
(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.
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.