Handouts/Lecture Notes
| Date | Topic |
|---|---|
| Aug 23 | Insertion Sort |
| Aug 25 | Merge Sort |
| Aug 30 | Asymptotic Notation Table 1, Table 2 |
| Sept 15 | Trees |
| Sept 15 | Heap Sort |
| Sept 20 | Quick Sort |
| Sept 22 | Analysis of Quick Sort |
| Sept 24 | Order Statistics & Sorting Lower Bound |
| Sept 27 | Sorting in Linear Time |
| Sept 29 | Binary Search Trees |
| Oct 1 | Red-Black Trees |
| Oct 4 | Red-Black Tree Insertion |
| Oct 6 | Dynamic Programming |
| Oct 11 | Longest Common Subsequence |
| Oct 15 | Greedy Algorithms |
| Oct 20 | Knapsack Problems |
| Oct 27 | Graph Basics |
| Nov 1 | Breadth-First Search |
| Nov 3 | Depth-First Search |
| Nov 8 | Minimum Spanning Trees (Part 1) |
| Nov 10 | Minimum Spanning Trees (Part 2) |
| Nov 12 | Single-Source Shortest Paths (Part 1) |
| Nov 15 | Single-Source Shortest Paths (Part 2) |
| Nov 17 | All-Pairs Shortest Paths |
| Nov 19 | NP-Completeness (Part 1) |
| Nov 29 | NP-Completeness (Part 2) |
| Dec 1 | NP-Completeness (Part 3) |
| Dec 6 | String Matching |
| Dec 8 | The Knuth-Morris-Pratt Algorithm |
Iowa State University - Computer Science Department - Top of this page