This schedule is speculative and subject to change.
Week Starting |
Topic |
Reading |
Week |
Notes/Videos |
M Jan 13 |
Introduction |
Chap 1-2 |
1 |
|
M Jan 20 | No class Monday, Jan 20, MLK Day Growth of functions, asymptotic notations |
Chap 3 |
2 |
|
M Jan 27 |
Recurrence Relations |
Chap 4.1, 4.3-4.5 |
3 |
|
M Feb 3 |
More Recurrence Relations |
. |
4 |
|
M Feb 10 |
O(n^2) sorting - bubble/selection, O(nlgn) sorting Heaps and heapsort |
Chap 6, 7 |
5 |
Video: (No Lecture 9), Lecture 10 |
M Feb 17 |
Quicksort, Mergesort |
Chap 7 |
6 |
Video: Lecture 11, Lecture 12 |
M Feb 24 | Linear time sorting Elementary data structures: ADTs, linked lists |
Chap 8, 10.1-10.2 |
7 |
Video: Lecture 13, (No Lecture 14) |
M Mar 3-8 |
Queues, stacks, rooted trees Proctored Midterm Exam March 3-8 |
Chap 10.3-10.4 |
8 |
Video: Lecture 15, Lecture 16 |
M Mar 10 | No Class - Spring Break | . |
9 |
. |
M Mar 17 |
Hash Tables |
Chap 11.1-11.4 |
10 |
Video: Lecture 17, Lecture 18 |
M Mar 24 |
Binary Search Trees, Red-Black Trees |
Chap 12-13 |
11 |
Video: Lecture 19, Lecture 20 |
M Mar 31 | Red-Black Trees, Disjoint Sets | Chap 12, 21.1-21.3 |
12 |
Graphs: part 1, part 2
Video: Lecture 21, Lecture 22 |
M Apr 7 | Graph Algorithms, Minimum Spanning Trees |
Chap 22-23 |
13 |
Video: Lecture 23, Lecture 24 |
M Apr 14 |
Kruskal & Prim's algorithms, Dijkstra's algorithm |
Chap 24 intro, 24.3 |
14 |
Video: Lecture 25 |
M Apr 21 | Proctored Final Exams April 21-26 | . |
15 |
. |
M Apr 28 | Nothing during finals week for in-person classes | . |
Finals |
. |