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
by Bill Casselman - Cambridge University Press
The author gives an introduction to basic features of the PostScript language and shows how to use it for producing mathematical graphics. The book includes the discussion computer graphics and some comments on good style in mathematical illustration.
(18244 views)
- 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.
(7044 views)
by Victor Shoup - 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.
(38188 views)
by R. L. Constable, at al. - Prentice Hall
The authors offer a tutorial on the new mathematical ideas which underlie their research. Many of the ideas in this book will be accessible to a well-trained undergraduate with a good background in mathematics and computer science.
(14249 views)