MIT 6.042J Mathematics for Computer Science, Spring 2015

About

View the complete course: http://ocw.mit.edu/6-042JS15

Instructor: Albert R. Meyer

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, well-ordering; 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.

License: Creative Commons BY-NC-SA

More information at http://ocw.mit.edu/terms

More courses at http://ocw.mit.edu

Archive

Internet Archive, in MIT OpenCourseWare

Licence or status

CC BY-NC-SA 3.0, as the Internet Archive states it.

Credit

MIT OpenCourseWare

Language

English

Subtitles

English

Who can watch

The archive gives no rating. Invisible Network shows it to Tweens profiles and older, judged from its collection and subjects. How films are placed