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.
Top Podcasts In Technology
Listeners Also Subscribed To
Design and Analysis of Algorithms (2015)
Erik Demaine, Srinivas Devadas, Nancy Ann Lynch
Mathematics for Computer Science (2010)
Tom Leighton, Marten van Dijk
Advanced Data Structures
Erik Demaine
Introduction to Algorithms (2011)
Erik Demaine, Srini Devadas
Learn Differential Equations: Up Close with Gilbert Strang and Cleve Moler
Gilbert Strang, Cleve Moler
OCW Scholar: Introduction to Computer Science and Programming
Prof. John Guttag
More by MIT
Introduction to Psychology
Prof. Jeremy Wolfe
Introduction to Computer Science and Programming
Eric Grimson, John Guttag
Artificial Intelligence
Patrick Winston, Mark Seifter
Linear Algebra
Prof. Gilbert Strang
Circuits and Electronics
Instructor: Prof. Anant Agarwal
Introduction to Algorithms (2005)
Prof. Erik Demaine Prof. Charles Leiserson