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
Terribly Organized, but Good content
Too many 1.2.3 videos that are 7 mins long and are unsorted. Therefore, instead of a clearly defined 1 hour episodes from 1100, you get 7 mins episodes that are like this:
1.3.1
2.4.1
1.1.1
3.2.1
1.1.2
There is no logical option to sort these and play them as they should, like this:
1.1.1
1.1.2
1.3.1
2.4.1
3.2.1
I had to take a screenshot of the playlist on iTunes via PC and use this as a reminder of which video to watch next.
Terribly organized, yet good content.