**Discrete Math for Computer Science Students**

by Ken Bogart, Cliff Stein

**Publisher**: Dartmouth College 2003**ISBN/ASIN**: 0132122715**Number of pages**: 252

**Description**:

It gives thorough coverage to topics that have great importance to computer scientists and provides a motivating computer science example for each math topic. Contents: Counting; Cryptography and Number Theory; Reflections on Logic and Proof.

Download or read it online for free here:

**Download link**

(multiple PDF files)

## Similar books

**generatingfunctionology**

by

**Herbert S. Wilf**-

**A K Peters, Ltd.**

The book about main ideas on generating functions and some of their uses in discrete mathematics. Generating functions are a bridge between discrete mathematics and continuous analysis. The book is suitable for undergraduates.

(

**21584**views)

**Lists, Decisions, and Graphs**

by

**Edward A. Bender, S. Gill Williamson**-

**University of California, San Diego**

In this book, four basic areas of discrete mathematics are presented: Counting and Listing, Functions, Decision Trees and Recursion, and Basic Concepts in Graph Theory. At the end of each unit is a list of Multiple Choice Questions for Review.

(

**7339**views)

**Introduction To Finite Mathematics**

by

**J. G. Kemeny, J. L. Snell, G. L. Thompson**-

**Prentice-Hall**

This book introduces college students to the elementary theory of logic, sets, probability theory, and linear algebra and treats a number of applications either from everyday situations or from applications to the biological and social sciences.

(

**15927**views)

**Discrete Mathematics for Computer Science**

by

**Jean Gallier**-

**arXiv**

These are notes on discrete mathematics for computer scientists. The presentation is somewhat unconventional. I emphasize partial functions more than usual, and I provide a fairly complete account of the basic concepts of graph theory.

(

**15510**views)