A Short Course in Discrete Mathematics
by Edward A. Bender 2020-05-07 22:57:33
image1
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: D... Read more
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. Less
  • File size
  • Print pages
  • Publisher
  • Publication date
  • ISBN
  • 9.2x6.1x0.6inches
  • 240
  • Dover Publications
  • December 1, 2004
  • 9780486439464
Compare Prices
image
Paperback
Available Discount
No Discount available
Related Books