Mathematics for Computer Science

Mathematics for Computer Science


Price: [price_with_discount]
(as of [price_update_date] – Details)

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.

The color images and text in this book have been converted to grayscale.



There are no reviews yet.

Be the first to review “Mathematics for Computer Science”

Your email address will not be published. Required fields are marked *