A Short Course In Discrete Mathematics
Book information
Description
This undergraduate-level describes the mathematics most needed in computer science. Bender and Williamson (both mathematics, U. of California, San Diego) cover Boolean functions 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.
Similar books
Lectures in Discrete Mathematics
2019 · PDF
Lectures in Discrete Mathematics
2017 · PDF
Foundations of Combinatorics with Applications
2006 · PDF
A Short Course in Discrete Mathematics
2004 · PDF
A Short Course in Discrete Mathematics
2005 · RAR
Mathematics for Algorithm and Systems Analysis
2005 · RAR
Foundations of Combinatorics with Applications
2006 · RAR
Foundations of Combinatorics with Applications
2006 · RAR