Some files will be in PDF format. To view them you may need to download Adobe Acrobat's free reader. This schedule is highly speculative and subject to change. It will be updated throughout the course.
| Date | Topic | Reading | Wk | Notes | ||
| T,R | Jan | 8,110 | Intro | Chap 1 | 1 | Basics |
| T,R | Jan | 15,17 | Basic Concepts: Notation, Math Review | Chap 2 | 2 | Master Method, Selection |
| T,R | Jan | 22,24 | Basic Concepts: Recurrence Relations | Chap 3, 4.1-4.3 | 3 | . |
| T,R | Jan | 29,31 | More Recurrence Relations | Chap 4.1-4.3 | 4 | Heaps |
| T,R | Feb | 5,7 | Selection, Sorting, Heaps | Chap 10, 7 | 5 | Other sorts, BST |
| T,R | Feb | 12,14 |
More selection, sorting Exam #1, Thursday 2/14 |
Chap 8, 9, 13 | 6 | Exam 1 Topics |
| T,R | Feb | 19,21 |
Graphs |
Chap 23 | 7 | Graphs |
| T,R | Feb | 26,28 | Minimum Spanning Trees, Shortest Path Algorithms | Chap 24, 25-25.2 | 8 | More Graphs |
| T,R | Mar | 5,7 | Complexity: P and NP | Chap 36 | 9 | P/NP |
| T,R | Mar | 12,14 |
Dynamic Programming |
Chap 16.1-16.3 | 10 | Dynamic Programming |
| T,R | Mar | 19,21 |
Greedy Algorithms (Activity-Selection, Huffman Codes) |
Chap 17 | 11 | |
| T,R | Mar | 26,28 |
Spring Break
|
12 |
| |
| T,R | Apr | 2,4 |
Exam #2, Tuesday 4/2 String Matching (Naive, Rabin-Karp, Automata, KMP, BM) |
Chap 34.1-34.4 | 13 | |
| T,R | Apr | 9,10 | Parallel Algorithms | . | 14 | PRAMs |
| T,R | Apr | 16,18 |
Genetic Algorithms |
. | 15 | Intro to GA's |
| T,R | Apr | 23,25 | Contingency Days | |||
| R | May | 2 | Final Exam, Thursday, 10:00-12:45 | Finals Week | Time Thursday, 10:00-12:45 PM | |
Time permitting, other material may also be included (possibilities include genetic algorithms, game-playing, crypto, graphics algorithims, image analysis, compression)