Lecture Schedule CSE 373
Spring 2005
===========================================

TUES  1/25/05   Intro to Algorithms
THU   1/27/05   Intro to Order Notation, Practice with elementary functions
TUES  2/01/05   More practice with elementary functions
THU   2/03/05   How to solve recurrences: recursion trees and induction
TUES  2/08/05   divide & conquer: addition circuits, matrix multiplication
THU   2/10/05   divide & conquer: matrix mult, strassens, addition lower bound
TUES  2/15/05   circuit layouts and quicksort
THU   2/17/05   end of quicksort, dynamic programming, knapsack problem 
TUES  2/22/05   dynamic programming, knapsack problem
THU   2/24/05   dynamic programming, edit distance 
TUES  3/01/05   edit distance, intro to newspaper whitespace problem
THU   3/03/05   intro to data structures, 2-3 trees, 2-4 trees, B-trees
TUES  3/08/05   HW discussion, static skip lists
THU   3/10/05   probability, insert/delete in skip lists
TUES  3/15/05   Midterm review
THU   3/17/05   MIDTERM EXAM
TUES  3/22/05   NO CLASS--Spring break
THU   3/24/05   NO CLASS--Spring break
TUES  3/29/05   exam review + hashing
THU   3/31/05   hashing
TUES  4/05/05   intro to graphs
THU   4/07/05   topological sort, MST (Kruskalls, Prims) 
TUES  4/12/05   structural properties of MSTs, Boruvkas, intro to shortest paths
THU   4/14/05   single source shortest paths in unweighted graphs, DAGS, general graphs (Dijkstras algorithm)
TUES  4/19/05   all pairs shortest paths (Floyd's algorithm) , shortest/longest  path in a DAG, relationshp with dynamic programming, newspaper DP 
THU   4/21/05   TSP 2-approximation 
TUES  4/26/05   scheduling, minimizing the makespan with precedence-constrained tasks
THU   4/28/05   NP-completeness and reductions
TUES  5/03/05   NP-completeness and reductions
THU   5/05/05   EXAM REVIEW (Last Day of CSE373)
 
TUES  5/17/05   (Final Exam) 11:00am - 1:30pm