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 Leonard Soicher, Franco Vivaldi - 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.
(17273 views)
- Wikibooks
The purpose of this book is to show how the computer can draw technically perfect pictures of Julia and Mandelbrot sets. All the necessary theory is explained and some words are said about how to put the things into a computer program.
(11273 views)
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.
(14484 views)
by Thomas Hales - arXiv
Computers have rapidly become so pervasive in mathematics that future generations may look back to this day as a golden dawn. The article gives a survey of mathematical proofs that rely on computer calculations and formal proofs.
(11887 views)