000			01710nam a2200229Ia 4500
003			NULRC
005			20250520094844.0
008			250520s9999 xx 000 0 und d
020			_a9789814096393
040			_cNULRC
050			_aQA 39.2 .J64 2001
100			_aJohnsonbaugh, Richard _eauthor
245		0	_aDiscrete mathematics / _cRichard Johnsonbaugh
250			_aFifth edition, Low price edition
260			_aSingapore : _bPearson Education Asia Pte. Ltd., _cc2001
300			_axv, 621 pages : _billustrations ; _c26 cm.
504			_aIncludes index.
505			_a1. 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.
520			_aThis 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.
650			_aMATHEMATICS
942			_2lcc _cBK
999			_c4458 _d4458