Discrete Mathematics / Edition 4by Richard Johnsonbaugh
Pub. Date: 09/28/1996
Publisher: Prentice Hall Professional Technical Reference
This best-selling book provides an accessible introduction to discrete mathematics through an algorithmic approach that focuses on problem- solving techniques. This edition has the techniques of proofs woven into the text as a running theme and each chapter has the problem-solving corner. The text provides complete coverage of: Logic and Proofs; Algorithms;… See more details below
This best-selling book provides an accessible introduction to discrete mathematics through an algorithmic approach that focuses on problem- solving techniques. This edition has the techniques of proofs woven into the text as a running theme and each chapter has the problem-solving corner. The text provides complete coverage of: Logic and Proofs; Algorithms; Counting Methods and the Pigeonhole Principle; Recurrence Relations; Graph Theory; Trees; Network Models; Boolean Algebra and Combinatorial Circuits; Automata, Grammars, and Languages; Computational Geometry. For individuals interested in mastering introductory discrete mathematics.
- Prentice Hall Professional Technical Reference
- Publication date:
- Edition description:
- Older Edition
- Product dimensions:
- 8.22(w) x 10.26(h) x 1.22(d)
Table of Contents
|1||Logic and Proofs||1|
|2||The Language of Mathematics||63|
|4||Counting Methods and the Pigeonhole Principle||197|
|8||Network Models and Petri Nets||455|
|9||Boolean Algebras and Combinatorial Circuits||500|
|10||Automata, Grammars, and Languages||546|
|Hints and Solutions to Selected Exercises||621|
and post it to your social network
Most Helpful Customer Reviews
See all customer reviews >
I agree with the others that this book needs to be burned. I have taken Discrete Mathematics one using this textbook and I also tried looking at the authors earlier edition, but it was a worthless attempt. I have to resort to using other resources such as the internet, other text, and individuals who have a firm undersatnding of the subject. The same individuals who are Computer Science or Math majors all agree that this book is trash. The author is probably a very intelligent individual but he does not explain much of anything in great detail. That is something that a novice needs to grasp a full understanding of the concepts. Without concepts the foundation is weak and clarity is non-existent. To whom it may concern choose another text book.
I am a Comp Sci student from WCU in Pa., this is a required reading for a 100 level math course (MAT151 to be exact). I found this book to be extremely informative and helpful, especially chapter 5 on Recurrence Relations. Perhaps the people who didn't do so well were either not ready for the course material or not devoted to their studying. Either way, good or bad, go to the B.N. store and read some of the book before you buy to see if you like it or not.