Essential Discrete Mathematics for Computer Science
eBook - PDF

Essential Discrete Mathematics for Computer Science

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

Essential Discrete Mathematics for Computer Science

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
  • Curated video supplements available to instructors and students
  • Solutions manual available to instructors

Frequently asked questions

Yes, you can cancel anytime from the Subscription tab in your account settings on the Perlego website. Your subscription will stay active until the end of your current billing period. Learn how to cancel your subscription.
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.
Perlego offers two plans: Essential and Complete
  • Essential is ideal for learners and professionals who enjoy exploring a wide range of subjects. Access the Essential Library with 800,000+ trusted titles and best-sellers across business, personal growth, and the humanities. Includes unlimited reading time and Standard Read Aloud voice.
  • Complete: Perfect for advanced learners and researchers needing full, unrestricted access. Unlock 1.4M+ books across hundreds of subjects, including academic and specialized titles. The Complete Plan also includes advanced features like Premium Read Aloud and Research Assistant.
Both plans are available with monthly, semester, or annual billing cycles.
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.
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.
Yes! You can use the Perlego app on both iOS or Android devices to read anytime, anywhere — even offline. Perfect for commutes or when you’re on the go.
Please note we cannot support devices running on iOS 13 and Android 7 or earlier. Learn more about using the app.
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 & Computer Science General. We have over one million books available in our catalogue for you to explore.
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

  1. Cover
  2. Title
  3. Copyright
  4. Dedication
  5. CONTENTS
  6. Preface
  7. 1 The Pigeonhole Principle
  8. 2 Basic Proof Techniques
  9. 3 Proof by Mathematical Induction
  10. 4 Strong Induction
  11. 5 Sets
  12. 6 Relations and Functions
  13. 7 Countable and Uncountable Sets
  14. 8 Structural Induction
  15. 9 Propositional Logic
  16. 10 Normal Forms
  17. 11 Logic and Computers
  18. 12 Quantificational Logic
  19. 13 Directed Graphs
  20. 14 Digraphs and Relations
  21. 15 States and Invariants
  22. 16 Undirected Graphs
  23. 17 Connectivity
  24. 18 Coloring
  25. 19 Finite Automata
  26. 20 Regular Languages
  27. 21 Order Notation
  28. 22 Counting
  29. 23 Counting Subsets
  30. 24 Series
  31. 25 Recurrence Relations
  32. 26 Probability
  33. 27 Conditional Probability
  34. 28 Bayes’ Theorem
  35. 29 Random Variables and Expectation
  36. 30 Modular Arithmetic
  37. 31 Public Key Cryptography
  38. Index