CSE 373 Tentative Day by Day Schedule (Winter 2010)

(This schedule is subject to change.)    Revised: 03-Jan-2010
 
Week # Monday Wednesday  Friday
1 Jan 4: Intro [W:preface] lecture pdf Jan 6: Intro to Eclipse, Visual Stack Applet, Begin Lists, Stacks and Queues lecture pdf Jan 8: ADTs, Lists, Iterators, Queue ADT [W:57-59, 62-67, 91-95]
2 Jan 11: Asymptotic Analysis I [W:29-50], Math Review [W:1-11], Discrete Math Background [T:DMB] lecture pdf Jan 13: Asymptotic Analysis II lecture pdf Jan 15: Trees, BSTs [W:101-122] lecture pdf
3 Jan 18: Martin Luther King Holiday (no class) Jan 20: AVL Trees [W:123-135] lecture pdf Jan 22: B-Trees [W:147-150], Memory Hierarchy [W:145-147] lecture pdf
4 Jan 25: B-Trees Jan 27: Priority Queues, Binary Min Heaps [W:201-210] lecture pdf Jan 29: Binary Min Heaps [W:210-216] lecture pdf
5 Feb 1: Review for Midterm Feb 3: Midterm 1 Feb 5: Graphs: Representations, Topological Sort [W:317-323] lecture pdf
6 Feb 8: Minimum Spanning Trees, Kruskal's Algorithm, Prim's Algorithm [W:349-355] lecture pdf Feb 10: Hashing [W:169-187] lecture pdf Feb 12: Disjoint Sets [W:293-304] lecture pdf
7 Feb 15: Presidents Day Holiday (no class) Feb 17: Disjoint Sets II [W:309-312] lecture pdf Feb 19: Disjoint Sets III
8 Feb 22: Sorting I [W:247-263] lecture pdf Feb 24: Sorting II [W:264-279] lecture pdf Feb 27: Review for Midterm 2
9 Mar 1: Midterm 2 Mar 3: Dynamic Programming [W:418-429] lecture pdf Mar 5: Image Data Structures lecture pdf
10 Mar 8: Project presentations Mar 10: Project presentations Mar 12: Review for Final
Mar 16 (Tuesday): FINAL EXAMINATION 2:30 PM - 4:20 PM