Discrete mathematics
Author(s)
Bibliographic Information
Discrete mathematics
Prentice Hall International, c1997
International ed
- : pbk
Available at / 1 libraries
-
No Libraries matched.
- Remove all filters.
Note
Previous ed.: Oxford : Maxwell Macmillan International , 1993
Includes bibliographical references (p. 615-620) and index
Description and Table of Contents
Description
Intended for one or two term introductory courses in discrete mathematics, this book offers an introduction through an algorithmic approach that focuses on problem-solving techniques. It stresses the importance of reading and doing proofs, and presents a discussion of algorithms, recursive algorithms, and the analysis of algorithms.
Table of Contents
1. Logic and Proofs2. The Language of Mathematics3. Algorithms4. Counting Methods and the Pigeonhole Principle5. Recurrence Relations6. Graph Theory7. Trees8. Network Models and Petri Nets9. Boolean Algebra and Combinatorial Circuits10. Automata, Grammars, and Languages11. Computational GeometryAppendix: MatricesReferencesHints and Solutions to Selected ExercisesIndex
by "Nielsen BookData"