Mathematics for Computer Science

Watch the Mathematics for Computer Science course from MIT, taught by Prof. Tom Leighton and Dr. Marten van Dijk in the fall of 2010. License: Creative commons BY-NC-SA This course covers elementary discrete mathematics for computer science and engineering. It emphasizes mathematical definitions and proofs as well as applicable methods. Topics include formal logic notation, proof methods; induction, well-ordering; sets, relations; elementary graph theory; integer congruences; asymptotic notation and growth of functions; permutations and combinations, counting principles; discrete probability. Further selected topics may also be covered, such as recursive definition and structural induction; state machines and invariants; recurrences; generating functions.