**Lists, Decisions, and Graphs**

by Edward A. Bender, S. Gill Williamson

**Publisher**: University of California, San Diego 2010**Number of pages**: 261

**Description**:

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

Download or read it online for free here:

**Download link**

(2.1MB, PDF)

Download mirrors:**Mirror 1**

## Similar books

**Advances in Discrete Differential Geometry**

by

**Alexander I. Bobenko (ed.)**-

**Springer**

This is the book on a newly emerging field of discrete differential geometry. It surveys the fascinating connections between discrete models in differential geometry and complex analysis, integrable systems and applications in computer graphics.

(

**8833**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.

(

**16455**views)

**Discrete Math for Computer Science Students**

by

**Ken Bogart, Cliff Stein**-

**Dartmouth College**

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.

(

**10359**views)

**Topics in Discrete Mathematics**

by

**A.F. Pixley**-

**Harvey Mudd College**

This text is an introduction to a selection of topics in discrete mathematics: Combinatorics; The Integers; The Discrete Calculus; Order and Algebra; Finite State Machines. The prerequisites include linear algebra and computer programming.

(

**12221**views)