CS 21
Schedule
| Week | Date | Lecture |
|---|---|---|
| 1 | 2/8 | Course Introduction, Review of Linked Lists, Stacks, Queues [10.1, 10.2] |
| 2 | 2/15 | Algorithm Analysis, Insertion Sort, Merge Sort [1.1, 1.2, 2.1, 2.2, 2.3.1, 3.1, 3.2] |
| 3 | 2/22 | Heapsort and Priority Queues [6.1, 6.2, 6.3, 6.4, 6.5] |
| 4 | 2/29 | Quicksort [7.1, 7.3] |
| 5 | 3/7 | Sorting in Linear Time [8.1, 8.2, 8.3, 8.4] |
| 6 | 3/14 |
Medians and Order Statistics, Huffman Codes [9.1, 9.2, 16.3], P and NP, Exponential and Unsolvable problems |
| 7 | 3/21 | Hash Tables [11.1, 11.2, 11.3, 11.4] |
| 8 | 3/28 | Data Structures for Disjoint Sets [21.1, 21.3] |
| 9 | 4/4 | Midterm Exam |
| 10 | 4/11 | Spring Break—no class meeting |
| 11 | 4/18 |
Binary Search Trees [12.1, 12.2, 12.3] Intro to binary search trees, binary search tree property, predecessor, sucessor, min, max, insert, delete, traversals |
| 12 | 4/25 | Elementary Graph Algorithms [22.1, 22.2, 22.3, 22.4, 22.5] |
| 13 | 5/2 |
Elementary Graph Algorithms [22.1, 22.2, 22.3, 22.4, 22.5] Minimum Spanning Trees [23.1, 23.2] |
| 14 | 5/9 |
Single-Source Shortest Path [24.1, 24.2, 24.3] All-Pairs Shortest Path [25.2] |
| 15 | 5/16 | Review and Special Topics |
| 16 | 5/23 | Final Exam |
| 17 | 05/30 | Wednesday, May 30, 7:00pm Final Exam Review (Discussion and Sample Solutions) |
This schedule is subject to change.