|
|
|
Date |
Topic |
Due Dates |
|
|
Aug 26 |
Algorithm Analysis and Binary Search |
|
3.1, 3.5, 3.6 |
|
Aug 28 |
Math & Proof Techniques |
|
3.3, 3.4 |
|
Sep 2 |
Experimental Algorithm Analysis |
|
3.7 |
|
Sep 4 |
Case Study: MCSS |
|
None |
|
Sep 9 |
Stacks & Queues |
|
4.1, 4.2 |
|
Sep 11 |
Linked Lists |
|
4.3 |
|
Sep 16 |
Double-Ended Queues |
|
4.4, 4.5 |
|
Sep 18 |
Binary Trees |
|
6.2 |
|
Sep 23 |
Binary Tree Implementation |
|
6.3 |
|
Sep 25 |
Exam Review |
Homework #2 due |
None |
|
Sep 30 |
Exam #1 |
|
None |
|
Oct 2 |
Recursion |
|
None |
|
Oct 7 |
Sorting: Merge Sort |
|
10.1 |
|
Oct 9 |
Quick Sort |
|
10.3,10.4 |
|
Oct 14 |
Quickselect, Bucket & Radix Sort |
|
10.7 |
|
Oct 16 |
Heaps & Heapsort |
|
7.3 |
|
Oct 21 |
Other sorts: Bucket and Radix |
|
10.5 |
|
Oct 23 |
Exam Review |
|
None |
|
Oct 28 |
Exam #2 |
|
None |
|
Oct 30 |
Hash Tables |
|
8.3 |
|
Nov 4 |
AVL Trees |
|
9.2 |
|
Nov 6 |
String Matching: Boyer-Moore |
|
11.2 |
|
Nov 13 |
Greedy Algorithms: Huffman Coding |
|
11.4 |
|
Nov 18 |
Dynamic Programming: LCS |
|
11.5 |
|
Nov 20 |
Dynamic Programming: Floyd-Warshall's Algorithm |
|
None |
|
Nov 25 |
Shortest-Pairs Problem: Dijkstra's Algorithm |
|
12.6 |
|
Dec 2 |
Minimum Spanning Trees |
|
12.7 |
|
Dec 4 |
Final Exam Review |
|
None |
|
Dec 9 (provisionally) |
Final Exam(4-7pm, provisionally) |
|
None |