Essential Discrete Mathematics for Computer Science

by Harry Lewis and Rachel Zax
Essential Discrete Mathematics for Computer Science cover
Good Books rating 4.23
Buy online
Amazon
Format/Price Check
Technical
  • ID: 8925
  • Added: 2025-12-22
  • Updated: 2025-12-22
  • Reviews: 3
Reviews
ACM Digital Library · Bill Gasarch · 2020-06-16
great 4.00

The book is noted for its good organisation, with each chapter suitable for one lecture, making it practical for educational use. The content is considered essential for understanding various aspects of computer science.

Bill Gasarch highlights the book's excellent organisation, pointing out that each chapter is designed to fit into a single lecture. This makes it a very practical resource for educators. They also emphasize the book's importance in covering essential topics in computer science, from algorithms to graph theory. Overall, they see it as a valuable tool for both teaching and learning.

Quick quotes

    In this column, we review these three books: 1. Essential Discrete Mathematics for Computer Science, by Harry Lewis and Rachel Zax.

    The importance of this book primarily stems from its good organisation, because each chapter of the book is suitable for one lecture.

    Discrete mathematics is the basis of much of computer science, from algorithms and automata theory to combinatorics and graph theory.

Amazon · 2020-01-01
good 4.20

The book is praised for its clear and cautious introduction to proofs and theorems, making it accessible for beginners. The later sections, however, are noted for their complexity.

This reviewer really liked how the authors took their time introducing proofs and theorems in the earlier parts of the book. They felt it was a great way to ease beginners into the subject. However, they also noted that the book becomes more complex as it progresses, which might be challenging for some readers. Overall, they thought the book was well-structured and informative, but perhaps not as beginner-friendly in its later chapters.

Quick quotes

    Generally speaking, I thought the authors did an excellent job in the earlier portions of the book, introducing proofs and theorems in a cautious, slow-paced manner.

    The book is cheaply priced and, oddly enough, still has some of those chapters that I can't imagine.

    Carefully constructed and elegantly written, this book delivers exactly what its title promises--an introductory treatment of all the essentials of discrete mathematics.

Barnes & Noble · 2020-01-01
excellent 4.50

The book is described as carefully constructed and elegantly written, delivering on its promise of covering essential discrete mathematics. It is seen as a comprehensive introduction to the subject.

This review describes the book as carefully constructed and elegantly written, living up to its title's promise. They see it as a comprehensive introduction to discrete mathematics, covering all the essential topics in a clear and accessible manner. The reviewer appreciates the book's thoroughness and the way it presents complex concepts in an understandable way. They think it's a great resource for anyone looking to get a solid foundation in the subject.

Quick quotes

    Carefully constructed and elegantly written, this book delivers exactly what its title promises--an introductory treatment of all the essentials of discrete mathematics.

    Discrete mathematics is the basis of much of computer science, from algorithms and automata theory to combinatorics and graph theory.

    An engineer is said to be a man who knows a great deal about a very little, and who goes around knowing more and more, about less and.

Appears in Lists