A Short Course in Discrete Mathematics
| Type | Book |
| Author | Edward A. Bender, S. Gill Williamson |
| Language | English |
| Publisher | 2005 |
| ISBN | 0-486-43946-1 |
| Pages | 240 |
Book Description
What sort of mathematics do I need for computer science? In response to this frequently asked question, a pair of professors at the University of California at San Diego created this text. Its sources are two of the university's most basic courses: Discrete Mathematics, and Mathematics for Algorithm and System Analysis. Intended for use by sophomores in the first of a two-quarter sequence, the text assumes some familiarity with calculus. Topics include Boolean functions and computer arithmetic; logic; number theory and cryptography; sets and functions; equivalence and order; and induction, sequences, and series. Multiple choice questions for review appear throughout the text. Original 2005 edition. Notation Index. Subject Index.
References
https://cseweb.ucsd.edu//~gill/BWLectSite/, https://cseweb.ucsd.edu//~gill/BWLectSite/Resources/errata%20SCDM.pdf