We are hiring: Developer Education Specialist

Class Central is learner-supported. When you buy through links on our site, we may earn an affiliate commission.

Massachusetts Institute of Technology

Mathematics for Computer Science

Massachusetts Institute of Technology via MIT OpenCourseWare

Start learning Write review

Overview

Level Up with Udemy Personal Plan
Unlimited access to thousands of top-rated courses. Build skills that matter.
Get Unlimited Access
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.

Syllabus

Lec 1 | MIT 6.042J Mathematics for Computer Science, Fall 2010.
Lec 2 | MIT 6.042J Mathematics for Computer Science, Fall 2010.
Lec 3 | MIT 6.042J Mathematics for Computer Science, Fall 2010.
Lec 4 | MIT 6.042J Mathematics for Computer Science, Fall 2010.
Lec 5 | MIT 6.042J Mathematics for Computer Science, Fall 2010.
Lec 6 | MIT 6.042J Mathematics for Computer Science, Fall 2010.
Lec 7 | MIT 6.042J Mathematics for Computer Science, Fall 2010.
Lec 8 | MIT 6.042J Mathematics for Computer Science, Fall 2010.
Lec 9 | MIT 6.042J Mathematics for Computer Science, Fall 2010.
Lec 10 | MIT 6.042J Mathematics for Computer Science, Fall 2010.
Lec 11 | MIT 6.042J Mathematics for Computer Science, Fall 2010.
Lec 12 | MIT 6.042J Mathematics for Computer Science, Fall 2010.
Lec 13 | MIT 6.042J Mathematics for Computer Science, Fall 2010.
Lec 14 | MIT 6.042J Mathematics for Computer Science, Fall 2010.
Lec 15 | MIT 6.042J Mathematics for Computer Science, Fall 2010.
Lec 16 | MIT 6.042J Mathematics for Computer Science, Fall 2010.
Lec 17 | MIT 6.042J Mathematics for Computer Science, Fall 2010.
Lec 18 | MIT 6.042J Mathematics for Computer Science, Fall 2010.
Lec 19 | MIT 6.042J Mathematics for Computer Science, Fall 2010.
Lec 20 | MIT 6.042J Mathematics for Computer Science, Fall 2010.
Lec 21 | MIT 6.042J Mathematics for Computer Science, Fall 2010.
Lec 22 | MIT 6.042J Mathematics for Computer Science, Fall 2010.
Lec 23 | MIT 6.042J Mathematics for Computer Science, Fall 2010.
Lec 24 | MIT 6.042J Mathematics for Computer Science, Fall 2010.
Lec 25 | MIT 6.042J Mathematics for Computer Science, Fall 2010.

Taught by

Prof. Albert R. Meyer and Prof. Adam Chlipala

Tags

Reviews

4.0 rating, based on 1 Class Central review

Start your review of Mathematics for Computer Science

  • Shubham Kumar
    The "Mathematics for Computer Science" online course from MIT is an exceptional resource for anyone delving into the intersection of math and computer science. Covering discrete mathematics, logic, combinatorics, and graph theory, it provides a solid foundation for algorithm design, cryptography, and computational complexity. The lectures are comprehensive, well-structured, and complemented by challenging problem sets to test understanding. As a free resource, its accessibility is unparalleled, though it demands strong commitment due to its rigor. Highly recommended for students and professionals looking to enhance their theoretical understanding of computer science concepts. A top-rated course for its depth and clarity!

Start learning

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Sign up for free
Someone learning on their laptop while sitting on the floor.