6.042 Mathematics for Computer Science
Elementary discrete mathematics for computer science and engineering. Emphasis on mathematical definitions and proofs as well as on applicable methods. Topics include formal logic notation, proof methods; induction, well-ordering; sets, relations; elementary graph theory; asymptotic notation and growth of functions; permutations and combinations, counting principles; discrete probability. Further selected topics include recursive definition and structural induction, state machines and invariants, integer congruences, recurrences, generating functions.
This class has 18.01 as a prerequisite.
Lecture occurs 2:30 PM to 4:00 PM on Tuesdays and Thursdays in 26-100.
This class counts for a total of 12 credits.
© Copyright 2015 Yasyf Mohamedali