|
A Short Course in Discrete Mathematics by Edward A. Bender,S. Gill Williamson
What sort of mathematics do I need for computer science? In response, a pair of professors at the University of California at San Diego created this text. Explores Boolean functions and computer arithmetic; logic; number theory and cryptography; sets and functions; equivalence and order; and induction, sequences, and series. Assumes some familiarity with calculus. Original 2005 edition. Dover Original. Table of Contents for A Short Course in Discrete Mathematics
| ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||