Available with WebAssign Online Homework and Grading System!
Written for the one-term course, Essentials of Discrete Mathematics, Third Edition is designed to serve computer science and mathematics majors, as well as students from a wide range of other disciplines. The mathematical material is organized around five types of thinking: logical, relational, recursive, quantitative, and analytical. This presentation results in a coherent outline that steadily builds upon mathematical sophistication. Graphs are introduced early and referred to throughout the text, providing a richer context for examples and applications. Algorithms are presented near the end of the text, after students have acquired the skills and experience needed to analyze them. The final chapter emphasizes the multidisciplinary approach and contains case studies that integrate the fields of biology, sociology, linguistics, economics, and music.
- NEW – Student Inquiry Problems, found at the beginning of each section, are designed to introduce and motivate the material in the section that follows
- NEW – Incorporates new content on Graph Theory
Key Features of Essentials of Discrete Mathematics:
- Coverage of algorithms appropriate for computer science majors, as well as students with no previous programming experience
- Careful attention to mathematical logic and proof techniques
- Instructor resources include an Instructor’s Solutions Manual, slides in PowerPoint format, and additional Inquiry Problems
- Updated and expanded WebAssign Online Homework and Grading System available for students and instructors. Includes 349 New Exercises!
Written for the one-term, undergraduate course in discrete mathematics.
Chapter 1 Logical Thinking
Chapter 2 Rational Thinking
Chapter 3 Recursive Thinking
Chapter 4 Quantitative Thinking
Chapter 5 Analytical Thinking
Chapter 6 Thinking Through Applications
Hints, Answers, and Solutions to Selected Exercises
David J. Hunter, PhD-Westmont College
David Hunter earned a B.S. in mathematics from the University of Illinois, and received an M.S. and Ph.D. in mathematics from the University of Virginia. He currently teaches mathematics and computer science at Westmont College in Santa Barbara, CA. His research interests include algebra, topology, and discrete methods. In addition to teaching and writing, he enjoys hacking, mountain biking, and rooting for four of the five professional sports teams from Chicago.