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