Mathematics for Computer Science (2015) MIT

 Technology

This course covers elementary discrete mathematics for computer science and engineering. It emphasizes mathematical definitions and proofs as well as applicable methods. Topics include formal logic notation, proof methods; induction, wellordering; sets, relations; elementary graph theory; integer congruences; asymptotic notation and growth of functions; permutations and combinations, counting principles; discrete probability. Further selected topics may also be covered, such as recursive definition and structural induction; state machines and invariants; recurrences; generating functions.
Customer Reviews
Top Podcasts In Technology
Listeners Also Subscribed To
More by MIT
Introduction to Psychology
Prof. Jeremy Wolfe
Linear Algebra
Prof. Gilbert Strang
Mathematics for Computer Science (2010)
Tom Leighton, Marten van Dijk
Introduction to Computer Science and Programming
Eric Grimson, John Guttag
Artificial Intelligence
Patrick Winston, Mark Seifter
Calculus Revisited: Single Variable Calculus
MIT OpenCourseWare