There will be weekly problem sets, each of which typically contains three to five multi-part problems. Typically you will not be required to solve all of the problems; you will be given the option to choose a subset that sums to 100 points. Some problems are purely theoretical in nature, while others are more computationally focused; those who prefer proofs to programming (or vice versa) can choose problems that appeal to their interests.
Problem sets are to be prepared in typeset form (typically via LaTeX) and submitted electronically as PDF files. Collaboration is encouraged, but you must write up your own solutions; there will be computational problems for which the correct answer will be different for every student, based on a unique identifier derived from your MIT ID number.
| RELATED LECTURES | PROBLEM SETS | DUE IN |
|---|---|---|
Lectures 1 through 3 | Lecture 5 | |
Lectures 3 and 4 | Lecture 7 | |
Lectures 5 through 7 | Lecture 9 | |
Lectures 7 through 9 | Lecture 11 | |
Lectures 10 and 11 | Lecture 13 | |
Lectures 12 and 13 | Lecture 15 | |
Lectures 13 and 14 | Lecture 17 | |
Lectures 15 through 17 | Lecture 19 | |
Lectures 17 and 18 | Lecture 20 | |
Lectures 18 through 20 | Lecture 22 | |
Lectures 18 through 22 | Lecture 24 | |
Lectures 23 through 25 | Lecture 26 |
