Join Books.org — it's free

Computer Mathematics, General & Miscellaneous Computing, Mathematics - General & Miscellaneous
A Short Course in Discrete Mathematics by Edward A. Bender β€” book cover

A Short Course in Discrete Mathematics

by Edward A. Bender, S. Gill Williamson
Available on Bookshop Write a review

Books.org participates in affiliate programs including Bookshop.org and the Amazon Services LLC Associates Program. We may earn a commission from qualifying purchases made through links on this page, at no additional cost to you.

Log in to track your reading progress.

Overview

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. 

Synopsis

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. Annotation ©2004 Book News, Inc., Portland, OR

Reviews

There are no reviews yet. Log in to write one.

Book Details

Published
January 1, 2005
Publisher
Dover Publications
Pages
256
Format
Paperback
ISBN
9780486439464

More by Edward A. Bender

Similar books