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.
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.
40.89
In Stock
5
1
Mathematics for Computer Science
1010
Mathematics for Computer Science
1010
40.89
In Stock
Product Details
| ISBN-13: | 9781680921229 |
|---|---|
| Publisher: | 12th Media Services |
| Publication date: | 06/05/2017 |
| Edition description: | New Edition |
| Pages: | 1010 |
| Product dimensions: | 8.50(w) x 11.00(h) x 1.99(d) |
From the B&N Reads Blog