ASSIGNMENTS | DESCRIPTIONs |
---|---|

Homework 1 (PDF) | Homework 1 has four questions. The first is a writing assignment to prepare a clear and complete proof of a theorem. There are also two optional exercises that do not need to be handed in. |

Homework 2 (PDF) | Homework 2 has four questions. Part of the first question is a writing assignment to correct the statement of the theorem and provide a well-written proof. There are also two optional exercises that do not need to be handed in. |

Homework 3 (PDF) | Homework 3 has five questions. The first is a writing assignment to revise Section 3 (and Section 3 only) of the incomplete lecture notes on Chernoff Bound. |

Homework 4 (PDF) | Homework 4 has three questions, all of them math assignments. |

Homework 5 (PDF) | Homework 5 has two questions, both of them writing assignments. |

Homework 6 (PDF) | Homework 6 is a term paper assignment. Each student will solve and write about just one of the three problems. The paper should be between 5 and 10 pages long. The schedule for the draft versions and final version are outlined in the homework document. |

Homework 7 (PDF) | Homework 7 is an assignment about writing a news article. The length of the article should be in the range 500–750 words and should be in the style of the sample MIT news articles and for the typical MIT news audience. |

Homework 8 (PDF) | Homework 8 has four math questions about linear programming. |

Homework 9 (PDF) | Homework 9 reminds students that the first complete draft of the term paper is due soon, and will be reviewed by the teaching staff as well as two students for peer review. There are also 5 math questions. |

Homework 10 (PDF) | Homework 10 provides guidelines and instructions for each student to solicit peer reviews from two students and, likewise, to peer review the term paper drafts of two students. |

Homework 11 (PDF) | Homework 11 has two math questions related to Discrete Fourier transforms. |

Homework 12 (PDF) | Homework 12 has three math questions related to Shannon Bounds, Huffman Codes, and Lempel-Ziv Codes. |