Lists, Decisions and Graphs - With an Introduction to Probability

Presents four basic areas of discrete mathematics: counting and listing, functions, decision trees and recursion, and basic concepts in graph theory.

**Tag(s):**
Discrete Mathematics
Graph Theory

**Publication date**: 31 Dec 2010

**ISBN-10**:
n/a

**ISBN-13**:
n/a

**Paperback**:
261 pages

**Views**: 4,938

**Type**: N/A

**Publisher**:
n/a

**License**:
Creative Commons Attribution 1.0 Generic

**Post time**: 13 Jul 2016 01:30:00

Lists, Decisions and Graphs - With an Introduction to Probability

Presents four basic areas of discrete mathematics: counting and listing, functions, decision trees and recursion, and basic concepts in graph theory.

You are free to:

Share — copy and redistribute the material in any medium or format

Adapt — remix, transform, and build upon the material for any purpose, even commercially.

The licensor cannot revoke these freedoms as long as you follow the license terms.

Click**here** to read the full license.

Share — copy and redistribute the material in any medium or format

Adapt — remix, transform, and build upon the material for any purpose, even commercially.

The licensor cannot revoke these freedoms as long as you follow the license terms.

Click

From the Preface:

Edward A. Bender and S. Gill Williamson wrote: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. These questions (answers provided) represent key ideas and should be returned to frequently as your study progresses. At the end of each section within a unit you will find a set of exercises. Try to solve them and check your answers against those provided at the end of the book.

Concepts from discrete mathematics are used in many different fields (e.g., computer programming, engineering, biology, economics, operations research, sociology). Each field has its own special terminology. In this book, we use the powerful and universal language of mathematics to unify these concepts and thus make available a much larger knowledge base to specialists.

The subjects presented here represent one of the most enjoyable and entertaining areas of mathematics. If possible, take your time and enjoy the problems. For most readers, the units of study can be taken in any order. The comprehensive index provided will allow you to fill in gaps in your knowledge from other parts of the book.

Tweet

About The Author(s)

Edward A. Bender is a Professor Emeritus of Mathematics in the Department of Mathematics at the UC San Diego. He received his Ph.D. in Mathematics at California Institute of Technology in 1966.

S. Gill Williamson is Professor Emeritus in the Department of Computer Science and Engineering at the University of California San Diego. His main research area is Algorithmic Combinatorics.

Book Categories

Computer Science
Introduction to Computer Science
Introduction to Computer Programming
Algorithms and Data Structures
Artificial Intelligence
Computer Vision
Machine Learning
Neural Networks
Game Development and Multimedia
Data Communication and Networks
Coding Theory
Computer Security
Information Security
Cryptography
Information Theory
Computer Organization and Architecture
Operating Systems
Image Processing
Parallel Computing
Concurrent Programming
Relational Database
Document-oriented Database
Data Mining
Big Data
Data Science
Digital Libraries
Compiler Design and Construction
Functional Programming
Logic Programming
Object Oriented Programming
Formal Methods
Software Engineering
Agile Software Development
Information Systems
Geographic Information System (GIS)

Mathematics
Mathematics
Algebra
Abstract Algebra
Linear Algebra
Number Theory
Numerical Methods
Precalculus
Calculus
Differential Equations
Category Theory
Proofs
Discrete Mathematics
Theory of Computation
Graph Theory
Real Analysis
Complex Analysis
Probability
Statistics
Game Theory
Queueing Theory
Operations Research
Computer Aided Mathematics

Supporting Fields
Web Design and Development
Mobile App Design and Development
System Administration
Cloud Computing
Electric Circuits
Embedded System
Signal Processing
Integration and Automation
Network Science
Project Management

Operating System
Programming/Scripting
Ada
Assembly
C / C++
Common Lisp
Forth
Java
JavaScript
Lua
Microsoft .NET
Rexx
Perl
PHP
Python
R
Rebol
Ruby
Scheme
Tcl/Tk

Miscellaneous
Sponsors