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

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

(

**12074**views)

**Discrete Mathematics with Algorithms**

by

**M. O. Albertson, J. P. Hutchinson**-

**J. Wiley**

This first-year course in discrete mathematics requires no calculus or computer programming experience. The approach stresses finding efficient algorithms, rather than existential results. Provides an introduction to constructing proofs...

(

**6462**views)

**Discrete Mathematics**

by

**W W L Chen**-

**Macquarie University**

Logic and sets, the natural numbers, division and factorization, languages, finite state machines, finite state automata, Turing machines, groups and modulo arithmetic, introduction to coding theory, group codes, public key cryptography, etc.

(

**24813**views)

**Mathematics for Computer Science**

by

**Eric Lehman, F Thomson Leighton, Albert R Meyer**-

**MIT**

An introduction to discrete mathematics oriented toward Computer Science and Engineering. Topics covered: Fundamental concepts of Mathematics: sets, functions, number theory; Discrete structures: graphs, counting; Discrete probability theory.

(

**13337**views)