TY  - BOOK
AU  - Johnsonbaugh, Richard
TI  - Discrete mathematics
SN  - 23607211
AV  - QA 39.2 .J64 1993 
PY  - 1993///
CY  - New York
PB  - Macmillan Publishing Company
KW  - MATHEMATICS
N1  - Includes bibliographical references and 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 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
N2  - This 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
ER  -