MIT Subject Listing & Schedule
Fall 2019 Search Results

Searched for:

1 subject found.

6.042[J] Mathematics for Computer Science

(, )
(Same subject as 18.062[J])
Prereq: Calculus I (GIR)
Units: 5-0-7
Lecture: TR2.30-4 (26-100) Recitation: WF10 (26-168) or WF1 (26-168) or WF2 (26-168) or WF3 (26-168) or WF11 (38-166) or WF12 (38-166) or WF1 (38-166) or WF2 (38-166) or WF3 (38-166) or WF11 (26-168) or WF10 (38-166) or WF12 (26-168) +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.
Z. Abel
No textbook information available