A short course in discrete mathematics.QA39 2004-063429 0-486-43946-1 A short course in discrete mathematics Discrete mathematics, also called finite mathematics or Decision Maths, is the study of mathematical structures that are fundamentally discrete, in the sense of not supporting or requiring the notion of continuity. . Bender, Edward A. and S. Gill Williamson. Dover Pub. Co., [c]2005 240 p. $14.95 (pa) This undergraduate-level describes the mathematics most needed in computer science. Bender and Williamson (both mathematics, U. of California, San Diego San Diego (săn dēā`gō), city (1990 pop. 1,110,549), seat of San Diego co., S Calif., on San Diego Bay; inc. 1850. San Diego includes the unincorporated communities of La Jolla and Spring Valley. Coronado is across the bay. ) cover Boolean functions A Boolean function describes how to determine a Boolean value output based on some logical calculation from Boolean inputs. These play a basic role in questions of complexity theory as well as the design of circuits and chips for digital computers. and computer arithmetic, logic, number theory and cryptography, sets and functions, equivalence and order, and induction, sequences and series, all in discrete units with multiple choice questions for review. They include solutions to exercises and notational and subject indices. Readers should have some familiarity with calculus calculus, branch of mathematics that studies continuously changing quantities. The calculus is characterized by the use of infinite processes, involving passage to a limit—the notion of tending toward, or approaching, an ultimate value. . |
|
||||||||||||||||||
Printer friendly
Cite/link
Email
Feedback
Reader Opinion