Mathematics for Computer Science

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.

Author: Eric Lehman, F. Thomson Leighton, Albert R. Meyer
Publisher: 12th Media Services
Published: 06/05/2017
Pages: 1010
Binding Type: Paperback
Weight: 5.04lbs
Size: 11.00h x 8.50w x 1.99d
ISBN: 9781680921229

This title is not returnable