|
Home
| Subject Search
| Help
| Symbols Help
| Pre-Reg Help
| Final Exam Schedule
| My Selections
|
Searched for: 1 subject found.
18.062[J] Mathematics for Computer Science
(
,
)
![]()
(Same subject as 6.042[J])
Prereq: Calculus I (GIR)
Units: 5-0-7
Lecture: TR2.30-4 (34-101) Recitation: WF10 (38-166) or WF11 (38-166) or WF12 (38-166) or WF1 (38-166) or WF2 (38-166) or WF3 (38-166) or WF10 (36-155) or WF11 (36-155) or WF12 (36-156) or WF1 (36-156) or WF2 (36-156) or WF3 (36-156) +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. Moitra
Spring: Z. Abel
No textbook information available