In recent years, an increasing number of computer scientists form diverse areas have used discrete mathematical structure to explaining concepts and problems. In this accessible text, Haggard, schleps, and Whiteside emphasize not only the fundamentals of discrete mathematics and its advance topics, but also how to express ideas in clear mathematical language. Students will discover the importance of discrete mathematics in describing computer science structures and problem solving, and will develop reasoning skills that will continue to be useful through their careers.
Chapter 1 Sets, Proof Templates, and Induction
Chapter 2 Formal Logic
Chapter 3 Relations
Chapter 4 Function
Chapter 5 Analysis of Algorithms
Chapter 6 Graph Theory
Chapter 7 Counting and Combinatorics
Chapter 8 Discrete Probability
Chapter 9 Recurrence Relations
Appendix