Appropriate for four different courses: Discrete Mathematics; Combinatorics; Graph Theory; Modern Applied Algebra this text has an enhanced mathematical approach, with carefully thought out examples, including many examples with computer sciences applications. Its organization includes four parts: Discrete Mathematics, Graph Theory, Modern Algebra, and Combinatorics.*Chapter summaries allow the student to review what they have learned, while historical reviews and biographies bring a human element to their assignments
Auflage
Sprache
Verlagsort
Verlagsgruppe
Zielgruppe
Maße
Höhe: 234 mm
Breite: 192 mm
Dicke: 34 mm
Gewicht
ISBN-13
978-0-201-30424-4 (9780201304244)
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
Part 1: Fundamentals of Discrete Mathematics 1. Fundamental Principles of Counting 2. Fundamentals of Logic 3. Set Theory 4. Properties of the Integers: Mathematical Induction 5. Relations and Functions 6. Languages: Finite State Machines 7. Relations: The Second Time Around Part 2: Further Topics in Enumeration 8. The Principle of Inclusion and Exclusion 9. Generating Functions 10. Recurrence Relations Part 3: Graph Theory and Applications 11. An Introduction to Graph Theory 12. Trees 13. Optimization and Matching Part 4: Modern Applied Algebra 14. Rings and Modular Arithmetic 15. Boolean Algebra and Switching Functions 16. Groups, Coding Theory, and Polya's 17. Finite Fields and Combinatorial Designs Appendix 1: Exponential and Logarithmic Functions Appendix 2: Matrices, Matrix Operations, and Determinants Appendix 3: Countable and Uncountable Sets Solutions Index
