| Week # | Monday | Wednesday | Friday |
| 1 | March 28: Introduction; Stacks & Queues lecture pdf | March 30 Math Review: Algorithm Analysis lecture pdf | April 1: Asymptotic Analysis lecture pdf |
| 2 | April 4: Priority Queues lecture pdf | April 6: More Binary Heaps lecture pdf | April 8: Dictionaries; Binary Search Trees lecture pdf |
| 3 | April 11: AVL Trees lecture pdf | April 13: Memory Hierarchy; B-Trees lecture pdf | April 15: More B-Trees lecture pdf |
| 4 | April 18: Hashing lecture pdf | April 20: Hashing II lecture pdf | April 22: Intro. to Sorting lecture pdf |
| 5 | April 25: Comparison Sorting lecture pdf | April 27: Beyond Comparison Sorting lecture pdf | April 29: Introduction to Graphs lecture pdf |
| 6 | May 2: Topological Sorting; Graph Traversal lecture pdf | May 4: Shortest Paths; Minimum Spanning Trees; UNION-FIND ADT lecture pdf | May 6: Introduction to Multithreading lecture pdf |
| 7 | May 9: Fork-Join Parallelism lecture pdf | May 11: Analysis of Fork-Join Parallel Programs | May 13: Review |
| 8 | May 16: Midterm exam | May 18: Parallel-Prefix Ops. and Parallel Sorting lecture pdf | May 20: Shared-Memory Concurrency and Mutual Exclusion lecture pdf |
| 9 | May 23: Programming with Locks and Critical Sections lecture pdf | May 25: Data Races & Deadlock lecture pdf | May 27: Reader/Writer Locks & Condition Variables |
| 10 | May 30: Memorial Day Holiday (no class) | June 1: Project Demonstrations | June 3: Review |
| June 7 (Tuesday): FINAL EXAMINATION 2:30 PM - 4:20 |