Discrete mathematics is fundamental to computer science, and this up-to-date text assists undergraduates in mastering the ideas and mathematical language to address problems that arise in the field's many applications. It consists of four units of study: counting and listing, functions, decision trees and recursion, and basic concepts of graph theory.
Mathematics for Algorithm and Systems Analysis
by Edward A. Bender & S. Gill WilliamsonDover (2005)
ISBN 0-486-44250-0
Book Link:
http://www.math.ucsd.edu/~ebender/DiscreteText2/index.html
Mathematics for Algorithm and Systems Analysis -2005-Edward A. Bender/S. Gill Williamson
Labels: Mathematics