000			01536nam a2200241Ia 4500
003			NULRC
005			20250520100613.0
008			250520s9999 xx 000 0 und d
020			_a9789810695927
040			_cNULRC
050			_aQA 39.2 .J64 2009
100			_aJohnsonbaugh, Richard. _eauthor
245		0	_aDiscrete mathematics / _cRichard Johnsonbaugh
250			_aSeventh edition. | Low price edition.
260			_aUpper Saddle River, New Jersey : _bPearson/Prentice Hall, _cc2009
300			_axvii, 766 pages : _billustrations ; _c26 cm.
365			_bPHP935
504			_aIncludes bibliographical references and index.
505			_aPreface -- Sets and logic -- Proofs -- Functions, sequences, and relations -- Algorithms -- Introduction to number theory -- Counting methods and the pigeonhole principle -- Recurrence relations -- Graph theory -- Trees -- Network models -- Boolean algebras and combinatorial circuits -- Automata, grammars, and languages -- Computational geometry -- Appendix: A. Matrices ; B. Algebra review ; C. Pseudocode -- References -- Hints and solutions to selected exercises -- Index.
520			_aFocused on helping students understand and construct proofs and expanding their mathematical maturity, this best-selling text is an accessible introduction to discrete mathematics. Johnsonbaugh’s algorithmic approach emphasizes problem-solving techniques. The Seventh Edition reflects user and reviewer feedback on both content and organization.
650			_aMATHEMATICS
942			_2lcc _cBK
999			_c9247 _d9247