I'm here to report that printing all the materials for the Spring 2005 version of MIT's 6.042J, Mathematics for Computer Science (known elsewhere as Discrete Math or Discrete Structures) will consume almost an entire ream of paper.
It's a very nice set of materials, though, covering Logic, Sets, Proofs, Induction, Number Theory, Graph Theory, Summations, Approximations, Asymptotics, Recurrences, Counting, Generating Functions, Probability, Conditional Probability, Independence, Random Variables & Distributions, Expectation, and Random Walks.
See also the Fall 2005 version of the same course. The notes aren't as nice, but the coverage varies slightly.
Syndicate Me via RSS!
(Instructions)
Copyright 2003-2009 Robert Szarka
Powered by Blosxom!