Mathematics for Algorithm and Systems Analysis

by 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 4 units of study: counting and listing, functions, decision trees and recursion, and basic concepts of graph theory.

Genres: Algorithms

256 pages, Paperback

First published July 28, 2005

Reviews

[David · Rating 5 out of 5]

One of the most clear and concise coverages of fundamental mathematics for computer science I’ve read