# Schedule

Date | Lect | Topic | Notes | |
---|---|---|---|---|

Tue Jan 12 | 1 | Introduction to 15-251 (slides) | ||

Wed Jan 13 | Lecture 1.5 on Proofs | |||

Thu Jan 14 | 2 | Deterministic finite automata (slides) | Homework 1 | |

Fri Jan 15 | Recitation 1 (solutions) | |||

Tue Jan 19 | 3 | Introduction to Turing Machines (slides) | ||

Wed Jan 20 | Homework 1 Writing Session | |||

Thu Jan 21 | 4 | Countability & diagonalization (slides) | Homework 2 | |

Fri Jan 22 | Recitation 2 (solutions) | |||

Tue Jan 26 | 5 | More on Turing Machines and computability (slides) | ||

Wed Jan 27 | Homework 2 Writing Session | |||

Thu Jan 28 | 6 | Undecidability (slides) | Homework 3 | |

Fri Jan 29 | Recitation 3 (solutions) | |||

Tue Feb 2 | 7 | Time complexity and big-O (slides) | ||

Wed Feb 3 | Homework 3 Writing Session | |||

Thu Feb 4 | 8 | Computational arithmetic (slides) | Midterm 1 Review | |

Fri Feb 5 | Recitation 4 (solutions) | |||

Tue Feb 9 | 9 | Boolean formulas and circuits (slides) | ||

Wed Feb 10 | Midterm 1 |
Practice problems | ||

Thu Feb 11 | 10 | Graph basics (slides) | Homework 4 | |

Fri Feb 12 | Recitation 5 (solutions) | |||

Tue Feb 16 | 11 | Graph search and MST (slides) | ||

Wed Feb 17 | Homework 4 Writing Session | |||

Thu Feb 18 | 12 | Matchings (slides) | Homework 5 | |

Fri Feb 19 | Recitation 6 (solutions) | |||

Tue Feb 23 | 13 | Stable Matchings + P vs NP (slides) | ||

Wed Feb 24 | Homework 5 Writing Session | |||

Thu Feb 25 | 14 | P vs NP and Polynomial Time Reductions (slides) | Homework 6 | |

Fri Feb 26 | Recitation 7 (solutions) | |||

Tue Mar 1 | 15 | Approximation algorithms (slides) | ||

Wed Mar 2 | Homework 6 Writing Session | |||

Thu Mar 3 | 16 | Gödel's incompleteness theorems^{*} (slides) |
Midterm 2 Review | |

Fri Mar 4 | No Recitation (8) | |||

Tue Mar 8 | Spring Break | |||

Wed Mar 9 | Spring Break | |||

Thu Mar 10 | Spring Break | |||

Fri Mar 11 | Spring Break | |||

Tue Mar 15 | 17 | Probability I (slides) | ||

Wed Mar 16 | Midterm 2 |
Practice problems | ||

Thu Mar 17 | 18 | Probability II (slides) | Homework 7 | |

Fri Mar 18 | Recitation 9 (solutions) | |||

Tue Mar 22 | 19 | Randomized algorithms (slides) | ||

Wed Mar 23 | Homework 7 Writing Session | |||

Thu Mar 24 | 20 | Random walks and Markov chains (slides) | Homework 8 | |

Fri Mar 25 | Recitation 10 (solutions) | |||

Tue Mar 29 | 21 | Group theory (slides) | ||

Wed Mar 30 | Homework 8 Writing Session | |||

Thu Mar 31 | 22 | Number Theory (slides) | Homework 9 | |

Fri Apr 1 | Recitation 11 (solutions) | |||

Tue Apr 5 | 23 | Cryptography (slides) | ||

Wed Apr 6 | Homework 9 Writing Session | |||

Thu Apr 7 | 24 | Fields and Polynomials (slides) | Midterm 3 Review | |

Fri Apr 8 | Recitation 12 (solutions) | |||

Tue Apr 12 | 25 | Fast multiplication (slides) | ||

Wed Apr 13 | Midterm 3 |
Practice problems | ||

Thu Apr 14 | Carnival | Homework 10 | ||

Fri Apr 15 | Carnival | |||

Tue Apr 19 | 26 | Quantum computation (slides) | ||

Wed Apr 20 | Homework 10 Writing Session | |||

Thu Apr 21 | 27 | Interactive Proofs (slides) | Homework 11 | |

Fri Apr 22 | Recitation 13 (solutions) | |||

Tue Apr 26 | 28 | Communication Complexity (slides) | ||

Wed Apr 27 | Homework 11 Writing Session | |||

Thu Apr 28 | 29 | Epilogue | ||

Fri Apr 29 | Recitation 14 (no solutions) | |||

Fri May 6 | Final Exam, 5:30 - 8:30pm |
Practice problems |