Essentials of Discrete Mathematics is the ideal text for a one-term discrete mathematics course to serve computer science majors as well students from a wide range of other disciplines. The material is organized around five types of mathematical 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 ...
Read More
Essentials of Discrete Mathematics is the ideal text for a one-term discrete mathematics course to serve computer science majors as well students from a wide range of other disciplines. The material is organized around five types of mathematical 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. Students will encounter algorithms near the end of the text, after they have acquired enough skills and experience to analyze them properly. The final chapter contains in-depth case studies from a variety of fields, including biology, sociology, linguistics, economics, and music. Clear and concise, Essentials of Discrete Mathematics presents a unified and complete picture of discrete math that instructors can move through in a single semester.
Read Less
It's a good book to use for conceptual reasons, but if you want specific examples and more practice problems, I would definitely not recommend it. The solutions in back are random too, not pure odds or evens.
