Tying together discrete mathematical topics with a theme, this text stresses both basic theory and applications, offering students a firm foundation for more advanced courses. It limits the mathematics required (no calculus), and explains the small amount of linear algebra that is needed. The book uses algorithms and pseudocode to illustrate techniques, provides coding exercises and features sections on mathematical structures, the predicate calculus, recurrence relations, functions for computer science, growth of functions and minimal spanning trees. A student solutions manual (0-13-515917-2) and instructor's manual (0-13-375064-7) are available.
Auflage
Sprache
Verlagsort
Verlagsgruppe
Zielgruppe
Maße
Höhe: 240 mm
Breite: 193 mm
Dicke: 24 mm
Gewicht
ISBN-13
978-0-13-320912-9 (9780133209129)
Copyright in bibliographic data is held by Nielsen Book Services Limited or its licensors: all rights reserved.
Schweitzer Klassifikation
1. Fundamentals. 2. Logic. 3. Counting. 4. Relations and Digraphs. 5. Functions. 6. Topics in Graph Theory. 7. Order Relations and Structures. 8. Trees. 9. Semigroups and Groups. 10. Languages and Finite-State Machines. 11. Groups and Coding. Appendix A: Algorithms and Pseudocode. Appendix B: Experiments in Discrete Mathematics. Answers to Odd-Numbered Exercises. Index.
