Mathematics for Algorithm and Systems Analysis

Mathematics for Algorithm and Systems Analysis

2005 • 248 pages

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.


Become a Librarian

Reviews

Popular Reviews

Reviews with the most likes.

There are no reviews for this book. Add yours and it'll show up right here!