$26.38
Availability: 50 left in stock

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.

Number of Pages: 240
Dimensions: 0.6 x 9.2 x 6.1 IN
Illustrated: Yes
Publication Date: December 13, 2004
  • Name : A Short Course in Discrete Mathematics - Paperback
  • Vendor : BooksCloud
  • Type : Books
  • Manufacturing : 2025 / 12 / 30
  • Barcode : 9780486439464
Categories:

    Guaranteed safe checkout:

    american expressapple paydiscovergoogle paymasterpaypalshopify payvisa
    A Short Course in Discrete Mathematics - Paperback
    - +