Log inSign up

Home / Courses

Mathematics

Mathematics for Computer Science

Electrical Engineering and Computer Science · Prof. Tom Leighton · Fall 2010 · Undergraduate

This course is published by MIT OpenCourseWare. Below are the lectures we have indexed, in the order they were taught. For problem sets, notes and exams, visit the original course page.

  1. Lecture 1: Introduction and Proofs
  2. Lecture 2: Induction
  3. Lecture 3: Strong Induction
  4. Lecture 4: Number Theory I
  5. Lecture 5: Number Theory II
  6. Lecture 6: Graph Theory and Coloring
  7. Lecture 7: Matching Problems
  8. Lecture 8: Graph Theory II: Minimum Spanning Trees
  9. Lecture 9: Communication Networks
  10. Lecture 10: Graph Theory III
  11. Lecture 11: Relations, Partial Orders, and Scheduling
Still from the lecture “Lecture 1: Introduction and Proofs”
Mathematics

Lecture 1: Introduction and Proofs

Mathematics for Computer Science · Prof. Tom Leighton

Still from the lecture “Lecture 2: Induction”
Mathematics

Lecture 2: Induction

Mathematics for Computer Science · Prof. Tom Leighton

Still from the lecture “Lecture 3: Strong Induction”
Mathematics

Lecture 3: Strong Induction

Mathematics for Computer Science · Prof. Tom Leighton

Still from the lecture “Lecture 4: Number Theory I”
Mathematics

Lecture 4: Number Theory I

Mathematics for Computer Science · Prof. Tom Leighton

Still from the lecture “Lecture 5: Number Theory II”
Mathematics

Lecture 5: Number Theory II

Mathematics for Computer Science · Prof. Tom Leighton

Still from the lecture “Lecture 6: Graph Theory and Coloring”
Mathematics

Lecture 6: Graph Theory and Coloring

Mathematics for Computer Science · Prof. Tom Leighton