Essential Discrete Mathematics for Computer Science
Lewis, Harry,Zax, Rachel
Sold by HPB-Red, Dallas, TX, U.S.A.
AbeBooks Seller since March 11, 2019
Used - Hardcover
Condition: Used - Good
Quantity: 1 available
Add to basketSold by HPB-Red, Dallas, TX, U.S.A.
AbeBooks Seller since March 11, 2019
Condition: Used - Good
Quantity: 1 available
Add to basketConnecting readers with great books since 1972! Used textbooks may not include companion materials such as access codes, etc. May have some wear or writing/highlighting. We ship orders daily and Customer Service is our top priority!
Seller Inventory # S_432737185
A more intuitive approach to the mathematical foundation of computer science
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.
Proven in the classroom, 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. The text requires only precalculus, and where calculus is needed, a quick summary of the basic facts is provided.
Essential Discrete Mathematics for Computer Science 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.
"About this title" may belong to another edition of this title.