CSE 373 Tentative Day by Day Schedule (Spring 2004)

(This schedule is subject to change.)    Revised: 13-May-2004    tanimoto@cs.washington.edu
 
Week # (+ milestone) Monday Wednesday  Friday
1 Mar 29: Introduction Mar 31: Mathematical Sets, Relations and Functions Apr 2: Java Review [GT, chapters 1,2]
2 (Assignment 1 due) Apr 5: Math Fundamentals and Recursion [GT, chapter 3] Apr 7: Stacks & Queues [GT, chapter 4] Apr 9: The ADT List [GT, chapter 5]
3 (Assignment 2 due) Apr 12: More on Lists Apr 14: Trees [GT, chapter 6] Apr 16: Priority Queues and Binary Heaps [GT, chapter 7]
4 Apr 19: Dictionaries and Hashing [GT, chapter 8] Apr 21: Dictionaries and Hashing (cont) Apr 23: AVL Trees [GT, chapter 9]
5 (Assignment 3 due) Apr 26: AVL Trees (cont) Apr 28: Splay Trees and B-Trees Apr 30: Splay Trees and B-Trees (cont)
6 May 3: Midterm May 5: Sorting Part I [GT, chapter 10] May 7: Sorting Part II
7 (Assignment 4 due) May 10: Sorting Part III May 12: Disjoint Sets May 14: Text Processing [GT, chapter 11]
8 May 17: Graph Terminology [GT, chapter 12] May 19: Directed Graphs I May 21: Directed Graphs II
9 May 24: Graph Searching May 26: Minimum Spanning Tree May 28: Circuits
10 (Group projects due) May 31:Memorial Day Holiday, no class Jun 2: Perspectives Jun 4 (Last day of classes): Demonstrations and Peer Evaluations
11 Jun 7: (no class) Jun 9: FINAL EXAMINATION 2:30-4:20