A Short Course in Discrete Mathemat

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. 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.

Edward A. Bender and S. Gill Williamson are both professors at the University of California at San Diego.

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.

This item is eligible for free returns within 30 days of delivery. See our returns policy for further details.