Authors: Richard Johnsonbaugh
ISBN-13: 9780131593183, ISBN-10: 0131593188
Format: Hardcover
Publisher: Prentice Hall
Date Published: January 2008
Edition: 7th Edition
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.
New edition of a time-tested text first published in 1984 in response to a need for a course that extended students' mathematical maturity and ability to deal with abstraction and included useful topics such as combinatorics, algorithms, and graphs. Intended for a one-or two- term introductory course, the text does not require knowledge of calculus, and there are no computer science prerequisites. Annotation c. by Book News, Inc., Portland, Or.
1 | Logic and Proofs | 1 |
2 | The Language of Mathematics | 63 |
3 | Algorithms | 142 |
4 | Counting Methods and the Pigeonhole Principle | 197 |
5 | Recurrence Relations | 256 |
6 | Graph Theory | 304 |
7 | Trees | 376 |
8 | Network Models and Petri Nets | 455 |
9 | Boolean Algebras and Combinatorial Circuits | 500 |
10 | Automata, Grammars, and Languages | 546 |
11 | Computational Geometry | 593 |
Appendix | Matrices | 610 |
References | 615 | |
Hints and Solutions to Selected Exercises | 621 | |
Index | 687 |