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.
Product details
- Paperback | 1010 pages
- 216 x 279 x 51mm | 2,286g
- 05 Jun 2017
- 12th Media Services
- English
- 1680921223
- 9781680921229
- 3,513,464
Download Mathematics for Computer Science (9781680921229).pdf, available at ebookdownloadfree.co for free.
Comments
Post a Comment