Discrete mathematics for computer science : or, (a bit of) the math that computer scientists need to know David Liben-Nowell.

Includes index.

On the point of this book -- Basic data types -- Logic -- Proofs -- Mathematical induction -- Analysis of algorithms -- Number theory -- Relations -- Counting -- Probability -- Graphs and trees.

Written exclusively with computer science students in mind with comprehensive treatment of standard course topics for the introductory discrete mathematics course with a strong emphasis on the relationship between the concepts and their application to computer science. Each chapter  begins with motivational content that relates the chapter topic to computer science practice and the book also includes over fifty "Computer Science Connections" which discuss applications to computer science such as Rotation Matrices; Game Trees, Logic, and Winning Tic-Tac(-Toe); Moore's Law; Secret Sharing; The Enigma Machine and the First Computer; Bayesian Modeling and Spam Filtering; and Quantum Computing.