Mathematics for Computer Science
Prof. Tom Leighton
Dr. Marten van Dijk
MIT Course Number
6.042J / 18.062J
As Taught In
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.
Other OCW Versions
OCW has published multiple versions of this subject.