Discrete mathematics is the foundation of much of computer science, from algorithms and automata theory to graph and combinatorics theory. This textbook includes discrete mathematics that every computer science student needs to learn. Guiding students rapidly through thirty-one short chapters that examine one major topic each, this flexible ebook can be tailored to fit the syllabi for a range of courses.
Proven in the classroom, Essential Discrete Mathematics for Computer Science, (PDF) aims to teach mathematical reasoning as well as skills and concepts by stressing the art of proof. It is fully illustrated in color, and every chapter includes a concise summary as well as a set of exercises. The text needs only precalculus, and where calculus is needed, a quick overview of the basic facts is provided.
Essential Discrete Mathematics for Computer Science is the perfect introductory textbook for standard undergraduate courses and is also appropriate for high school courses, self-study and distance education for adult learners.
- Includes over 300 exercises
- Solutions manual available to instructors
- Each chapter contains a concise summary
- Almost every formula and theorem proved in full
- The essential introduction to discrete mathematics
- Includes thirty-one short chapters, each suitable for a single class lesson
- The breadth of content makes the ebook adaptable to a variety of courses
“This excellent ebook is an outstanding combination of rigor, clarity, and elegance. Zax and Lewis have produced an extraordinarily comprehensive guide to the world of discrete mathematics―a guide that will be important for any student of computer science.” ― John MacCormick, Dickinson College
NOTE: The product only includes the ebook, Essential Discrete Mathematics for Computer Science in PDF. No access codes are included.