Discrete mathematics /
Johnsonbaugh, Richard
Discrete mathematics / Richard Johnsonbaugh - Fifth edition, Low price edition - Singapore : Pearson Education Asia Pte. Ltd., c2001 - xv, 621 pages : illustrations ; 26 cm.
Includes index.
1. Logic and Proofs -- 2. The Language of Mathematics -- 3. Algorithms -- 4. Counting Methods and the Pigeonhole Principle -- 5. Recurrence Relations -- 6. Graph Theory -- 7. Trees -- 8. Network Models -- 9. Boolean Algebras and Combinational Circuits -- 10. Automata, Grammars and Languages -- 11. Computational Geometry -- A. Matrices -- B. Algebra Review -- References -- Hints and Solutions to Selected Exercises -- Index.
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.
9789814096393
MATHEMATICS
QA 39.2 .J64 2001
Discrete mathematics / Richard Johnsonbaugh - Fifth edition, Low price edition - Singapore : Pearson Education Asia Pte. Ltd., c2001 - xv, 621 pages : illustrations ; 26 cm.
Includes index.
1. Logic and Proofs -- 2. The Language of Mathematics -- 3. Algorithms -- 4. Counting Methods and the Pigeonhole Principle -- 5. Recurrence Relations -- 6. Graph Theory -- 7. Trees -- 8. Network Models -- 9. Boolean Algebras and Combinational Circuits -- 10. Automata, Grammars and Languages -- 11. Computational Geometry -- A. Matrices -- B. Algebra Review -- References -- Hints and Solutions to Selected Exercises -- Index.
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.
9789814096393
MATHEMATICS
QA 39.2 .J64 2001