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

**Lecture Notes in Discrete Mathematics**

by

**Marcel B. Finan**-

**Arkansas Tech University**

This book is designed for a one semester course in discrete mathematics for sophomore or junior level students. The text covers the mathematical concepts that students will encounter in computer science, engineering, Business, and the sciences.

(

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

(

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

(

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

(

**5664**views)