Logo

Mathematics for Algorithm and Systems Analysis

Large book cover: Mathematics for Algorithm and Systems Analysis

Mathematics for Algorithm and Systems Analysis
by

Publisher: Dover Publications
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.

Home page url

Download or read it online for free here:
Download link
(multiple PDF files)

Similar books

Book cover: FractalsFractals
- Wikibooks
The aim of this text is to develop an informal, light introduction to the world of fractal geometry and to inspire further research into the subject, whether your interest is of a pure, applied or even recreational nature.
(11772 views)
Book cover: Algorithmic MathematicsAlgorithmic Mathematics
by - Queen Mary University of London
This text is a course in mathematical algorithms, intended for second year mathematics students. It introduces the algorithms for computing with integers, polynomials and vector spaces. The course requires no computing experience.
(26926 views)
Book cover: A Computational Introduction to Number Theory and AlgebraA Computational Introduction to Number Theory and Algebra
by - Cambridge University Press
This introductory book emphasises algorithms and applications, such as cryptography and error correcting codes. It is accessible to a broad audience. Prerequisites are a typical undergraduate course in calculus and some experience in doing proofs.
(44312 views)
Book cover: An Architecture for Combinator Graph ReductionAn Architecture for Combinator Graph Reduction
by - 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.
(19792 views)