The complete lecture notes including homework assignments.
Day | Date | Topics Covered | Notes and Readings |
---|---|---|---|
Tue | Aug 28 | Lecture 1: Overview of 15-210 and Sequencing the Genome | lecture notes |
Wed | Aug 29 | Recitation 1 - Parenthesis matching — Assignment 1 out | recitation notes |
Thu | Aug 30 | Lecture 2: Algorithmic Cost Models | lecture notes |
Tue | Sep 04 | Lecture 3: Algorithmic Techniques and Divide-and-Conquer | lecture notes |
Wed | Sep 05 | Recitation 2 - Recurrences and Scan — Assignment 1 due | recitation notes |
Thu | Sep 06 | Lecture 4: Divide and Conquer II — Assignment 2 out | lecture notes |
Tue | Sep 11 | Lecture 5: Data Abstraction and Sequences I | lecture notes |
Wed | Sep 12 | Recitation 3 - More Scan | recitation notes |
Thu | Sep 13 | Lecture 6: Sequences II | lecture notes |
Tue | Sep 18 | Lecture 7: Collect, Sets, and Tables — Assignment 2 due (Monday, 11:59pm); Assignment 3 out |
lecture notes |
Wed | Sep 19 | Recitation 4 - Fields and MapCollectReduce | recitation notes |
Thu | Sep 20 | Lecture 8: Sets and Tables II | lecture notes |
Tue | Sep 25 | Lecture 9: Graphs, Graph Representations and Graph Search — Assignment 3 due (Monday, 11:59pm); Assignment 4 out |
lecture notes |
Wed | Sep 26 | Recitation 5 - Graph Examples, StSeqs and Staging | recitation notes |
Thu | Sep 27 | Lecture 10: BFS and applications | lecture notes |
Tue | Oct 02 | Lecture 11: DFS and applications — Assignment 4 due (Monday, 11:59pm) |
lecture notes |
Wed | Oct 03 | Recitation 6 - Midterm review | |
Thu | Oct 04 | Lecture 12: Exam I | |
Tue | Oct 09 | Lecture 13: Shortest Weighted Paths I — Assignment 5 out | lecture notes |
Wed | Oct 10 | Recitation 7 - Exam I Debriefing | recitation notes |
Thu | Oct 11 | Lecture 14: Shortest Weighted Paths II | lecture notes |
Tue | Oct 16 | Lecture 15: Randomized Algorithms | lecture notes |
Wed | Oct 17 | Recitation 8 - Probability Review — Assignment 5 due (Wednesday, 11:59pm) |
recitation notes |
Thu | Oct 18 | Lecture 16: Graph Contraction — Assignment 6 out | lecture notes |
Tue | Oct 23 | Lecture 17: Graph Contraction II | lecture notes |
Wed | Oct 24 | Recitation 9 - Graph Contraction | recitation notes |
Thu | Oct 25 | Lecture 18: Minimum Spanning Tree | lecture notes |
Tue | Oct 30 | Lecture 19: Sorting: Quicksort and Lower bounds | lecture notes |
Wed | Oct 31 | Recitation 10 - Graph Contraction — Assignment 7 out | recitation notes |
Thu | Nov 01 | Lecture 20: Balanced Trees I - Split, Join, Union | lecture notes |
Tue | Nov 06 | Lecture 21: Treaps — Assignment 7 due (Monday, 11:59pm) | lecture notes |
Wed | Nov 07 | Recitation 11 - Exam Review | |
Thu | Nov 08 | Lecture 22: No Class: Midterm II | |
Tue | Nov 13 | Lecture 23: Ordered Sets, Augmented Trees — Assignment 8 out | lecture notes |
Wed | Nov 14 | Recitation 12 - Exam Debriefing | |
Thu | Nov 15 | Lecture 24: Dynamic Programming I | lecture notes |
Tue | Nov 20 | Lecture 25: Dynamic Programming II; Assignment 9 out | lecture notes |
Wed | Nov 21 | Thanksgiving Break - No Class | |
Thu | Nov 22 | Thanksgiving Break - No Class | |
Tue | Nov 27 | Lecture 26: Hashing | lecture notes |
Wed | Nov 28 | Recitation 13 - DP Practice | recitation notes |
Thu | Nov 29 | Lecture 27: Priority Queues and Leftist Heaps; Assignment 10 out | lecture notes |
Tue | Dec 04 | Lecture 28: Other Parallel Languages | |
Wed | Dec 05 | Recitation 14 - More DP | recitation notes |
Thu | Dec 06 | Lecture 29: Review |