Essential Discrete Mathematics for Computer Science
eBook - PDF

Essential Discrete Mathematics for Computer Science

Harry Lewis, Rachel Zax

Share book
  1. English
  2. PDF
  3. Available on iOS & Android
eBook - PDF

Essential Discrete Mathematics for Computer Science

Harry Lewis, Rachel Zax

Book details
Book preview
Table of contents
Citations

About This Book

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
  • Solutions manual available to instructors

Frequently asked questions

How do I cancel my subscription?
Simply head over to the account section in settings and click on “Cancel Subscription” - it’s as simple as that. After you cancel, your membership will stay active for the remainder of the time you’ve paid for. Learn more here.
Can/how do I download books?
At the moment all of our mobile-responsive ePub books are available to download via the app. Most of our PDFs are also available to download and we're working on making the final remaining ones downloadable now. Learn more here.
What is the difference between the pricing plans?
Both plans give you full access to the library and all of Perlego’s features. The only differences are the price and subscription period: With the annual plan you’ll save around 30% compared to 12 months on the monthly plan.
What is Perlego?
We are an online textbook subscription service, where you can get access to an entire online library for less than the price of a single book per month. With over 1 million books across 1000+ topics, we’ve got you covered! Learn more here.
Do you support text-to-speech?
Look out for the read-aloud symbol on your next book to see if you can listen to it. The read-aloud tool reads text aloud for you, highlighting the text as it is being read. You can pause it, speed it up and slow it down. Learn more here.
Is Essential Discrete Mathematics for Computer Science an online PDF/ePUB?
Yes, you can access Essential Discrete Mathematics for Computer Science by Harry Lewis, Rachel Zax in PDF and/or ePUB format, as well as other popular books in Mathematics & Discrete Mathematics. We have over one million books available in our catalogue for you to explore.

Information

Publisher
Princeton University Press
Year
2019
ISBN
9780691190617
Topic
Mathematics
Subtopic
Discrete Mathematics
Index
Mathematics
10
essential
discrete
mathematics
for
computer
science
hash
value.
We
count
the
number
of
collisions
on
a
hash
value
as
1
less
than
the
number
of
strings
that
have
that
hash
value,
so
if
2
strings
have
the
same
hash
value
there
is
1
collision
on
that
hash
value.
If
there
are
m
strings
and
p
possible
hash
values,
what
is
the
minimum
number
of
collisions
that
must
occur
on
the
hash
value
with
the
most
collisions?
The
maximum
number
of
collisions
that
might
occur
on
some
hash
value?

Table of contents