A Short Course In Discrete Mathematics
Edward A. Bender, S. Gill Williamson
This undergraduate-level describes the mathematics most needed in computer science. Bender and Williamson (both mathematics, U. of California, San Diego) cover Boolean functions and computer arithmetic, logic, number theory and cryptography, sets and functions, equivalence and order, and induction, sequences and series, all in discrete units with multiple choice questions for review. They include solutions to exercises and notational and subject indices. Readers should have some familiarity with calculus.
