A Short Course in Discrete Mathematics - Paperback
Description
by Edward A. Bender (Author), S. Gill Williamson (Author)
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.
Author Biography
Edward A. Bender and S. Gill Williamson are both professors at the University of California at San Diego.
Care
To maintain the beauty and integrity of your purchase, we recommend treating it with care. Simple maintenance practices, such as gentle washing and proper storage, can effectively preserve the longevity of your favorites. We encourage you to refer to the care instructions included with each item, designed to help you keep your purchase in top condition.
Design
Our dedication to excellence extends beyond materials; it encompasses the artistry and craftsmanship illustrated in every piece we create.