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

(

**8633**views)

**Discrete Structures**

by

**Vladlen Koltun**-

**Stanford University**

Contents: Sets and Notation; Induction; More Proof Techniques; Divisibility; Prime Numbers; Modular Arithmetic; Relations and Functions; Mathematical Logic; Counting; Binomial Coefficients; Inclusion-Exclusion Principle; Pigeonhole Principle; etc.

(

**11097**views)

**Languages and Machines**

by

**C. D. H. Cooper**-

**Macquarie University**

This is a text on discrete mathematics. It includes chapters on logic, set theory and strings and languages. There are some chapters on finite-state machines, some chapters on Turing machines and computability, and a couple of chapters on codes.

(

**19615**views)

**Applied Discrete Structures**

by

**Al Doerr, Ken Levasseur**-

**Lulu.com**

Applied Discrete Structures is a two semester undergraduate text in discrete mathematics, focusing on the structural properties of mathematical objects. These include matrices, functions, graphs, trees, lattices and algebraic structures.

(

**7830**views)