6.042J / 18.062J Mathematics for Computer Science, Spring 2005
Author(s)Leiserson, Charles; Lehman, Eric; Devadas, Srinivas; Meyer, Albert R.
Mathematics for Computer Science
MetadataShow full item record
This course is offered to undergraduates and is an elementary discrete mathematics course oriented towards applications in computer science and engineering. Topics covered include: formal logic notation, induction, sets and relations, permutations and combinations, counting principles, and discrete probability.
Elementary discrete mathematics for computer science and engineering, mathematical definitions, proofs and applicable methods, 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, recursive definition, structural induction, state machines and invariants, recurrences, generating functions, 6.042J, 6.042, 18.062J, 18.062