6.042J / 18.062J Mathematics for Computer Science, Spring 2005
Name
6-042j-spring-2005/contents/index.htm
Size
36.82 KB
Format
HTML
Checksum (MD5)
9c2549525a4e51a6b9fb1d5fa84b4386
Author(s)
Leiserson, Charles
Lehman, Eric
Devadas, Srinivas
Meyer, Albert R.
Alternative Title
Mathematics for Computer Science
Date Issued
June 2005
Abstract
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.
Subjects
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
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Massachusetts Institute of Technology. Department of Mathematics
Terms of Use
Persistent DSpace Link
