A Short Course In Discrete Mathematics - Brossura

Bender, Edward A.; Williamson, S. Gill

 
9780486439464: A Short Course In Discrete Mathematics

Sinossi

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.

Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.

Product Description

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.

Contenuti

Boolean Functions and Computer Arithmetic Logic Number Theory and Cryptography Sets and Functions Equivalence and Order Induction, Sequences and Series Notation Index Subject Index Solutions to Problems

Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.