Essential Discrete Mathematics for Computer Science - by Harry Lewis & Rachel Zax (Hardcover)
Similar Products
Products of same category from the store
All
Product info
<p/><br></br><p><b> About the Book </b></p></br></br>Discrete mathematics is the basis of much of computer science, from algorithms and automata theory to combinatorics and graph theory. Essential Discrete Mathematics for Computer Science aims to teach mathematical reasoning as well as concepts and skills by stressing the art of proof. It is fully illustrated in color, and each chapter includes a concise summary as well as a set of exercises.<p/><br></br><p><b> Book Synopsis </b></p></br></br><p><b>A more intuitive approach to the mathematical foundation of computer science</b></p><p>Discrete mathematics is the basis of much of computer science, from algorithms and automata theory to combinatorics and graph theory. This textbook covers the discrete mathematics that every computer science student needs to learn. Guiding students quickly through thirty-one short chapters that discuss one major topic each, this flexible book can be tailored to fit the syllabi for a variety of courses.</p><p>Proven in the classroom, <i>Essential Discrete Mathematics for Computer Science</i> aims to teach mathematical reasoning as well as concepts and skills by stressing the art of proof. It is fully illustrated in color, and each chapter includes a concise summary as well as a set of exercises. The text requires only precalculus, and where calculus is needed, a quick summary of the basic facts is provided.</p><p><i>Essential Discrete Mathematics for Computer Science</i> is the ideal introductory textbook for standard undergraduate courses, and is also suitable for high school courses, distance education for adult learners, and self-study.<br><ul><li>The essential introduction to discrete mathematics<br></li><li>Features thirty-one short chapters, each suitable for a single class lesson<br></li><li>Includes more than 300 exercises<br></li><li>Almost every formula and theorem proved in full<br></li><li>Breadth of content makes the book adaptable to a variety of courses<br></li><li>Each chapter includes a concise summary<br></li><li>Solutions manual available to instructors<br></li></ul></p><p/><br></br><p><b> Review Quotes </b></p></br></br><br>Those teaching computer scientists who take discrete mathematics alongside other mathematics modules such as linear algebra and calculus (as is the case with the CS20 students at Harvard), and who need a book with an emphasis on proof, will likely and this book a very good choice for their students.<b>---London Mathematical Society, <i>Glenn Hawe</i></b><br><br>I want to share with everybody my enjoyment of this excellent textbook.<b>---Narciso Marti-Oliet, <i>European Math Society</i></b><br><p/><br></br><p><b> About the Author </b></p></br></br><b>Harry Lewis </b>is Gordon McKay Professor of Computer Science and former dean of Harvard College at Harvard University. His books include <i>Blown to Bits: Your Life, Liberty, and Happiness after the Digital Explosion</i>. <b>Rachel Zax</b> is a software engineer at Google.
Price History
Cheapest price in the interval: 75 on November 8, 2021
Most expensive price in the interval: 75 on December 20, 2021
Price Archive shows prices from various stores, lets you see history and find the cheapest. There is no actual sale on the website. For all support, inquiry and suggestion messagescommunication@pricearchive.us