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.

Item Information Item Information

Format: TradePaperback
Author: Lehman, Eric
ISBN: 9781680921229
Condition: New
Dimensions: 11.00 x 1.99
Number Of Pages: 1010
Publication Year: 2017

Language: English

Mathematics for Computer Science

Available Offers

Overview

Customer Reviews