| January 9 | Course overview | --- |
| January 11 | Introduction | Chapter 1 |
| January 16 | Introduction | |
| January 18
. |
Math review
Asymptotic notation |
Section 2.2
Section 2.1 |
| January 23 | Asymptotic notation | |
| January 25 | Recurrences | Chapter 4 |
| January 30
. |
Recurrences
Heap-Sort |
Chapter 7 |
| February 1 | Heap-Sort | |
| February 6 | Quick-Sort | Section 8.1-8.3 |
| February 8
. |
Quick-Sort
Counting-Sort |
Section 9.2 |
| February 13
. |
Radix-Sort
Stacks and queues |
Section 9.3
Section 11.1 |
| February 15 | EXAM #1 | --- |
| February 20 | Binary search trees | Sections 13.1-13.3 |
| February 22 | Binary search trees | |
| February 27 | Disjoint sets | Sections 22.1-22.3 |
| March 1 | Disjoint sets | |
| March 6
. |
Disjoint sets
Representing graphs |
Section 23.1 |
| March 8
. |
Representing graphs
Breadth-first search |
Section 23.2 |
| March 20 | Depth-first search | Section 23.3 |
| March 22
. |
Topological sort
Spanning trees |
Section 23.4
Chapter 24 |
| March 27 | Spanning trees | Chapter 24 |
| March 29 | EXAM #2 | --- |
| April 3 | Greedy algorithms | Section 17.1 and 17.2 |
| April 5
. |
Greedy algorithms
Huffman codes |
Section 17.3 |
| April 10
. |
Huffman codes
Matrix chains |
Section 17.3
Section 16.1 |
| April 12 | Matrix chains | |
| April 17 | Common subsequence | Section 16.3 |
| April 19 | NP problems | Section 36.2 |
| April 24
. |
NP problems
Examples of NP |
Section 36.5 |
| April 26 | FINAL EXAM | --- |