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.
Author: Eric Lehman, F. Thomson Leighton, Albert R. Meyer
Binding Type: Hardcover
Publisher: Samurai Media Limited
Published: 03/08/2017
Pages: 988
Weight: 5.6lbs
Size: 11.00h x 8.50w x 2.00d
ISBN: 9789888407064
Language: English
This title is not returnable
Reviews
There are no reviews yet.