
Essential Discrete Mathematics for Computer Science
Princeton University Press
Published on 19. March 2019
Book
Hardback
408 pages
978-0-691-17929-2 (ISBN)
Description
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.
The essential introduction to discrete mathematics
Features thirty-one short chapters, each suitable for a single class lesson
Includes more than 300 exercises
Almost every formula and theorem proved in full
Breadth of content makes the book adaptable to a variety of courses
Each chapter includes a concise summary
Curated video supplements available to instructors and students
Solutions manual available to instructors
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.
The essential introduction to discrete mathematics
Features thirty-one short chapters, each suitable for a single class lesson
Includes more than 300 exercises
Almost every formula and theorem proved in full
Breadth of content makes the book adaptable to a variety of courses
Each chapter includes a concise summary
Curated video supplements available to instructors and students
Solutions manual available to instructors
Reviews / Votes
"I want to share with everybody my enjoyment of this excellent textbook."---Narciso Marti-Oliet, European Math Society "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."---London Mathematical Society, Glenn HaweMore details
Language
English
Place of publication
New Jersey
United States
Target group
College/higher education
Product notice
Trade binding
Illustrations
116 color + 77 b/w illus. 19 tables.
Dimensions
Height: 261 mm
Width: 209 mm
Thickness: 30 mm
Weight
1181 gr
ISBN-13
978-0-691-17929-2 (9780691179292)
Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited or by the publishers or by their respective licensors: all rights reserved.
Schweitzer Classification
Other editions
Additional editions

Harry Lewis | Rachel Zax
Essential Discrete Mathematics for Computer Science
E-Book
03/2019
United Methodist Publishing House
€90.99
Available for download
Persons
Harry Lewis is Gordon McKay Professor of Computer Science and former dean of Harvard College at Harvard University. His books include Blown to Bits: Your Life, Liberty, and Happiness after the Digital Explosion. Rachel Zax is a software engineer at Google.