6.042J Mathematics for Computer Science
6.042J/18.062J Mathematics for Computer Science (Fall 2010, MIT OCW). Instructors: Prof. Tom Leighton and Dr. Marten van Dijk. 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. (from ocw.mit.edu)
| Lecture 06 - Graph Theory and Coloring |
An introduction to graph theory basics and intuition with applications to scheduling, coloring, and even sexual promiscuity.
Go to the Course Home or watch other lectures: