000			01483nam a2200229Ia 4500
003			NULRC
005			20250520094846.0
008			250520s9999 xx 000 0 und d
020			_a23607211
040			_cNULRC
050			_aQA 39.2 .J64 1993
100			_aJohnsonbaugh, Richard _eauthor
245		0	_aDiscrete mathematics / _cRichard Johnsonbaugh
250			_aThird edition.
260			_aNew York : _bMacmillan Publishing Company, _cc1993
300			_axiv, 800 p. : _billustrations ; _c20 cm.
504			_aIncludes bibliographical references and 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 and Petri Nets -- 9. Boolean Algebras and Combinational Circuits -- 10. Automata, Grammars and Languages -- 11. Computational Geometry -- Appendix: Matrices -- References -- Hints and Solutions to Selected Exercises -- Index.
520			_aThis book is intended for a one- or two-term introductory course in discrete mathematics. Formal mathematics prerequisites are minimal; calculus is not required. There are no computer science prerequisites. The book includes examples, exercises, figures, notes, chapter reviews, and self-tests to help the reader master introductory discrete mathematics. In addition to the book, an Instructor's Guide is available.
650			_aMATHEMATICS
942			_2lcc _cBK
999			_c4576 _d4576