Essentials of Discrete Mathematics

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 & Key Features: 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 - 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

David J. Hunter is a professor of Mathematics and Computer Science at Westmont College.