An ever-increasing percentage of mathematic applications involve discrete rather than continuous models. Driving this trend is the integration of the computer into virtually every aspect of modern society. Intended for a one-semester introductory course, the strong algorithmic emphasis of Discrete Mathematics, 5th Edition is independent of a specific programming language, allowing students to concentrate on foundational problem-solving and analytical skills. Instructors get the topical breadth and organizational flexibility to tailor the course to the level and interests of their students.
This title is part of the Pearson Modern Classics series. Pearson Modern Classics are acclaimed titles at a value price.
Reihe
Auflage
Sprache
Verlagsort
Verlagsgruppe
Zielgruppe
Für höhere Schule und Studium
Maße
Höhe: 100 mm
Breite: 100 mm
Dicke: 100 mm
Gewicht
ISBN-13
978-0-13-468956-2 (9780134689562)
Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited or by the publishers or by their respective licensors: all rights reserved.
Schweitzer Klassifikation
1: An Introduction to Combinatorial Problems and Techniques
2: Sets, Relations, and Functions
3: Coding Theory
4: Graphs
5: Trees
6: Matching
7: Network Flows
8: Counting Techniques
9: Recurrence Relations and Generating Functions
10: Combinatorial Circuits and Finite State Machines
Appendix A: An Introduction to Logic and Proof
Appendix B Matrices
Historical Notes
Appendix C The Algorithms in This Book
Bibliography
Answers to odd-numbered exercises
Index
