**Mathematics for Algorithm and Systems Analysis**

by Edward A. Bender, S. Gill Williamson

**Publisher**: Dover Publications 2005**ISBN/ASIN**: 0486442500**ISBN-13**: 9780486442501**Number of pages**: 256

**Description**:

Discrete mathematics is an essential tool in many areas of computer science. Problems in discrete mathematics arise in programming languages, computer architecture, networking, distributed systems, database systems, AI, theoretical computer science, and other areas. 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.

Download or read it online for free here:

**Download link**

(multiple PDF files)

## Similar books

**Vector Math for 3D Computer Graphics**

by

**Bradley Kjell**-

**Central Connecticut State University**

A text on vector and matrix algebra from the viewpoint of computer graphics. It covers most vector and matrix topics needed for college-level computer graphics text books. Useful to computer science students interested in game programming.

(

**19942**views)

**Computer Algebra, Algorithms, Systems and Applications**

by

**Richard Liska, at al.**-

**Czech Technical University**

From the table of contents: Introduction; Algorithms for algebraic computation; Integrated mathematical systems; Basic possibilities of integrated mathematical systems; Applications of computer algebra; Another sources of study.

(

**15336**views)

**Think Stats: Probability and Statistics for Programmers**

by

**Allen B. Downey**-

**Green Tea Press**

Think Stats is an introduction to Probability and Statistics for Python programmers. This new book emphasizes simple techniques you can use to explore real data sets and answer interesting statistical questions. Basic skills in Python are assumed.

(

**18972**views)

**An Architecture for Combinator Graph Reduction**

by

**Philip J. Koopman, Jr.**-

**Academic Press**

The results of cache-simulation experiments with an abstract machine for reducing combinator graphs are presented. The abstract machine, called TIGRE, exhibits reduction rates that compare favorably with previously reported techniques.

(

**14197**views)