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 with SageMathby Zunaid Ahmed, Hellen Colman, Samuel Lubliner
The book provides complete instructions on how to use different Sage functions to solve problems in Discrete Math. Our goal is to streamline the learning process, helping students focus more on mathematics and reducing the learning how to code.
(2593 views)
Lecture Notes in Discrete Mathematicsby 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.
(19100 views)
Notes on Discrete Mathematicsby 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.
(22691 views)
Topics in Discrete Mathematicsby 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.
(14213 views)