Mathematics for Algorithm and Systems Analysis -2005-Edward A. Bender/S. Gill Williamson

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.
Read more and Download →







