| # | Date | Reading | Topic | HW/Exam Due |
|---|
| 1 | T 10 Sep | ch1-3
|
Algorithmic complexity, divide-and-conquer
| |
| 2 | T 17 Sep | ch4
| class cancelled due to Sean's illness
| |
| 3 | T 24 Sep | ch4,6
|
Math review, logic, induction, proofs;
Sorting: Binary Max-Heaps and Heapsort
| |
| | R 26 Sep | |
HW1: ch2-3 |
| 4 | T 1 Oct | ch7
|
Priority Queue and Quicksort
| Quiz1: ch1-3 |
| 5 | T 8 Oct | ch8, 11 (skip 11.5)
|
Linear-time sorting: radix sort, bucket sort
Hash tables: chaining, open addressing
| |
| | R 10 Oct | |
HW2: ch4,6 |
| 6 | T 15 Oct | ch10 (skip 10.3), ch12 (skip 12.4)
|
Data structures: linked-lists, stacks/queues, binary search trees
| |
| 7 | T 22 Oct | ch15 (skip 15.4)
|
Dynamic Programming
| |
| | R 24 Oct | |
HW3: ch7,8,11 |
| 8 | T 29 Oct | ch16 (skip 16.4-5)
|
Greedy Algorithms and Huffman coding
| Quiz2: ch4,6-8,11 |
| 9 | T 5 Nov | ch22
|
Graph algorithms: breadth-first, depth-first
| |
| | R 7 Nov | |
HW4: ch10,12,15 |
| | T 12 Nov |
(Remembrance Day, no class)
|
| 10 | T 19 Nov | ch23, 24 (skip 24.4)
|
Minimum spanning trees (Kruskal, Prim);
Single-source shortest path (Bellman-Ford, Dijkstra)
| |
| | F 22 Nov | |
HW5: ch15,16 |
| 11 | T 26 Nov | --
|
Quiz 3
| Quiz3: ch10,12,15,16 |
| 12 | T 3 Dec | ch25
|
All-pairs shortest paths (Floyd-Warshall, Johnson)
Semester Review
| |
| | R 5 Dec | |
HW6: ch22,23,24 |
| | R 12 Dec |
Final Exam: 14:00-17:00 Neu 20 (solutions included) |