| Week of | Monday | Wednesday | Thursday | Friday - Section | Reading |
| June 22 |
Introduction, Course Overview, Stacks and Queues Project 1 released |
Asymptotic Analysis Homework 1 assigned |
Asymptotic Analysis |
Intro | Chapters 1, 2, 3 |
| June 29 | Binary Heaps Project 1 due Project 2A released |
Binary Heaps Homework 2 assigned Homework 1 due |
D-heaps |
Chapter 6 | |
| July 6 |
Leftist Heaps Skew Heaps |
Binomial queues Homework 3 assigned Homework 2 due |
Binary Search Trees | Chapter 6 | |
| July 13 | AVL Trees Project 2A due Project 2B released |
Splay Trees Homework 4 assigned Homework 3 due |
B Trees | Chapter 4 | |
| July 20 | Flex/Review | Midterm Exam
Homework 5 assigned Homework 4 due |
Hashing |
Chapter 4, 5 | |
| July 27 |
Hashing Project 2B due Project 3 released |
Disjoint sets Homework 6 assigned Homework 5 due |
Disjoint Sets |
Chapters 5, 8 | |
| Aug 3 | Sorting |
Sorting Homework 7 assigned Homework 6 due |
Graphs |
Chapters 7, 9 | |
| Aug 10 |
Graphs, Topological Sort |
Single-Source Shortest Paths Homework 8 assigned Homework 7 due |
Minimum Spanning Trees, All-Pairs Shortest Paths | Project 3 code due | Chapters 7, 8, 9 |
| Aug 17 |
Flex
Project 3 writeup due |
Final Review
Homework 8 due |
Final Review | Final Exam |