Essential Discrete Mathematics for Computer Science

Regular price €90.99
Quantity:
In stock with our UK publisher. 14-28 days
Delivery/Collection within 10-20 working days
14 days return policy Shipping & Delivery
A01=Harry Lewis
A01=Rachel Zax
Age Group_Uncategorized
Age Group_Uncategorized
Algorithm
Applied mathematics
Arithmetic logic unit
Author_Harry Lewis
Author_Rachel Zax
automatic-update
Bijection
Binary logarithm
Binary number
Binary relation
Binary search algorithm
Category1=Non-Fiction
Category=PBD
Category=UY
Computation
Computer program
Computer science
Computer scientist
Concatenation (mathematics)
COP=United States
Delivery_Delivery within 10-20 working days
Deterministic finite automaton
Diagram (category theory)
Discrete logarithm
Discrete mathematics
eq_bestseller
eq_computing
eq_isMigrated=2
eq_nobargain
eq_non-fiction
Expression (mathematics)
Fermat's little theorem
Foundations of mathematics
Function (mathematics)
Fundamental theorem of arithmetic
Graph (discrete mathematics)
Graph coloring
Gray code
Harmonic series (mathematics)
Hash function
Inequality (mathematics)
Instance (computer science)
Integer
Language_English
Logical disjunction
Master theorem
Mathematical fallacy
Mathematical induction
Mathematical logic
Mathematical proof
Mathematician
Mathematics
Modular arithmetic
Multiplicity (mathematics)
Natural number
Optimization problem
PA=Available
Parity (mathematics)
Permutation
Pigeonhole principle
Plaintext
Polynomial
Predicate (mathematical logic)
Price_€50 to €100
Probability
Proportionality (mathematics)
Propositional calculus
Propositional variable
PS=Active
Public-key cryptography
Quantifier (logic)
Random variable
Recursion (computer science)
Regular expression
Result
Series (mathematics)
Set (mathematics)
Sign (mathematics)
softlaunch
Square (algebra)
Subset
Summation
Theorem
Theory of computation
Traditional mathematics
Truth table
Variable (computer science)
Variable (mathematics)

Product details

  • ISBN 9780691179292
  • Weight: 1157g
  • Dimensions: 178 x 254mm
  • Publication Date: 19 Mar 2019
  • Publisher: Princeton University Press
  • Publication City/Country: US
  • Product Form: Hardback
  • Language: English
Secure checkout Fast Shipping Easy returns

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
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.

More from this author