Mathematics for Computer Science

Mathematics for Computer Science

68 Ungluers have Faved this Work
This book covers elementary discrete mathematics for computer science and engineering. It emphasizes mathematical definitions and proofs as well as applicable methods. Topics include formal logic notation, proof methods; induction, well-ordering; sets, relations; elementary graph theory; integer congruences; asymptotic notation and growth of functions; permutations and combinations, counting principles; discrete probability. Further selected topics may also be covered, such as recursive definition and structural induction; state machines and invariants; recurrences; generating functions.

Why read this book? Have your say.

You must be logged in to comment.

Rights Information

Are you the author or publisher of this work? If so, you can claim it as yours by registering as an rights holder.


This work has been downloaded 2600 times via ebook links.
  1. 926 - pdf (2017/6/2) (CC BY-SA) at
  2. 1674 - pdf (CC BY-NC-SA) at Internet Archive.


  • Computer science
  • Mathematics
  • Nonfiction
  • Textbooks




edition cover


Copy/paste this into your site: