Home
| Subject Search
| Help
| Symbols Help
| Pre-Reg Help
| Final Exam Schedule
| My Selections
|
Searched for: "6.042" Subjects offered any term 1 subject found.
6.042[J] Mathematics for Computer Science
(, )
(Same subject as 18.062[J])
Prereq: Calculus I (GIR)
Units: 5-0-7
http://theory.csail.mit.edu/classes/6.042
Lecture: MWF1-2.30 (32-082, 32-044) or MWF2.30-4 (32-044, 32-124) +final
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.
Fall: A. Meyer
Spring: Z. Abel
No textbook information available