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

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

(

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

(

**5744**views)

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

(

**15749**views)

**Notes on Discrete Mathematics**

by

**Miguel A. Lerma**

Summary of the course CS 310: Mathematical Foundations of Computer Science. It covers concepts of discreet mathematics and applications to computer science, logic and Boolean circuits, functions, sets, relations, databases, finite automata, and more.

(

**15213**views)