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.
Auflage
Sprache
Verlagsort
Verlagsgruppe
Zielgruppe
Maße
Höhe: 254 mm
Breite: 200 mm
Dicke: 27 mm
Gewicht
ISBN-13
978-0-13-571191-0 (9780135711910)
Copyright in bibliographic data is held by Nielsen Book Services Limited or its licensors: all rights reserved.
Schweitzer Klassifikation
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
