Subj : Re: Mathematics for programmers
To   : comp.programming
From : Jon Harrop
Date : Tue Jul 05 2005 05:20 pm

CTips wrote:
> thushianthan15@hotmail.com wrote:
> ...
> combinatorics (graph theory)
> linear algebra (finite groups/fields)
> logic (predicate, modal, temporal, higher-order, proof-theory)
> queuing theory/stochastic processes
> probability
> topology

More importantly:

  asymptotic complexity

without it, you cannot begin to determine which algorithms are fast and
which are slow.

-- 
Dr Jon D Harrop, Flying Frog Consultancy
http://www.ffconsultancy.com

.