| Lecture |
Date |
Topic |
Detail |
Readings |
Homework |
Notes |
| 1 |
Jan 13 |
Course introduction |
Methodologies |
Chapter 1, Section 1 |
|
|
| 2 |
Jan 15 |
Agorithmic analysis |
Asymptotic analysis |
Chapter 1, Section 2-3 |
|
|
| 3 |
Jan 20 |
Algorithmic analysis |
Time/space tradoffs |
Chapter 1, Section 4 & 6 |
|
|
| 4 |
Jan 22 |
Data structures |
Trees |
Chapter 2, Section 3 |
|
Chapter 2, Section 1 & 2 |
| 5 |
Jan 27 |
******************** |
*********** |
******************** |
|
Class Cancelled--Snow Day
|
| 6 |
Jan 29 |
Data structures |
Heaps |
Chapter 2, Section 4 |
Homework #1 |
|
| 7 |
Feb 3 |
Data structures |
Hash Tables |
Chapter 2, Section 5 |
|
|
| 8 |
Feb 5 |
Data structures |
Hash Tables |
Chapter 2, Section 5 |
|
|
| 9 |
Feb 10 |
Search trees |
Binary Search Trees |
Chapter 3, Section 1-2 |
|
|
| 10 |
Feb 12 |
Search trees |
Bounded Depth Trees |
Chapter 3, Section 3 |
|
|
| 11 |
Feb 17 |
Sorting algorithms |
Merge-Sort |
Chapter 4, Sections 1-2 |
Homework #2 |
|
| 12 |
Feb 19 |
Sorting algorithms |
Quick-Sort |
Chapter 4, Sections 3 |
|
|
| 13 |
Feb 24 |
Sorting algorithms |
Lower Bound Comparision |
Chapter 4, Section 4 |
|
Discuss Project |
| 14 |
Feb 26 |
Sorting algorithms |
Radix-Sort |
Chapter 4, Sections 5-6 |
|
|
| 15 |
Mar 2 |
Review |
|
|
Homework #3 |
|
| 16 |
Mar 4 |
Midterm |
|
|
|
|
| 17 |
Mar 9 |
Algorithmic strategies |
Greedy Method |
Chapter 5, Section 1 |
|
|
| 18 |
Mar 11 |
Algorithmic strategies |
Divide-and-Conquer |
Chapter 5, Section 2 |
|
|
| 19 |
Mar 16 |
Algorithmic strategies |
Dynamic-Programming |
Chapter 5, Section 3 |
|
|
| 20 |
Mar 18 |
Algorithmic strategies |
Dynamic-Programming |
Chapter 5, Section 3 |
|
|
|
Mar 23 |
Spring Break |
|
|
|
No Class |
|
Mar 25 |
Spring Break |
|
|
|
No Class |
| 21 |
Mar 30 |
Graph algorithms |
Traversal |
Chapter 6, Section 3 |
Homework #4 |
Chapter 6, Section 1-2 |
| 22 |
Apr 1 |
Graph algorithms |
Di-Graphs |
Chapter 6, Section 4 |
|
|
| 23 |
Apr 6 |
Graph algorithms |
Single-Souce Shortest Path |
Chapter 7, Section 1 |
|
|
| 24 |
Apr 8 |
Graph algorithms |
All-Pairs Shortest Path |
Chapter 7, Section 2 |
|
|
| 25 |
Apr 13 |
Graph algorithms |
Minimum Spanning Trees |
Chapter 7, Section 3 |
|
|
| 26 |
Apr 15 |
String algorithms |
KMP & Boyer Moore |
Chapter 9, Section 1 |
|
|
| 27 |
Apr 20 |
String algorithms |
Longest Common Subsequence |
Chapter 9, Section 4 |
Homework #5 |
|
| 28 |
Apr 22 |
TBD |
|
|
|
|
| 29 |
Apr 27 |
Complexity classes |
P and NP |
Chapter 13, Section 1-2 |
Project Due |
|
| 30 |
Apr 29 |
Review |
|
|
Homework #6 |
|
|
May 5 |
Final Exam: Wednesday 12:45-2:00pm |
|
|
|
|