CSE 373 Tentative Day by Day Schedule (Winter 2002)

Unless stated otherwise, assignments will be due at the beginning of class Friday. (This schedule is subject to change.)    Revised: 31-Dec-2001, 12-Feb-2002, 3-Mar-2002    tanimoto@cs.washington.edu
 
Week # Monday Wednesday  Friday
1 Jan 7: Course introduction; individual problems for Assignment 1 given to each student Jan 9: Pretest; time to discuss Assignment 1 and trade questions Jan 11: Mathematical background: Sets, Relations, Functions
2. Assignment 1 due; optional extra session Monday at 4:30 PM on Unix techniques for Assignment 1; optional extra session Thursday at 4:30 PM on Java classes, inheritance, access modifiers, and interfaces. Both sessions will be held in Collaboratory 1, OUGL 102. Jan 14: Mathematical background: Operations in Abstract Data Types Jan 16: Java fundamentals and review [Sahni, Chapter 1] Jan 18: Java applets. The TextTestApplet example.
3. Assignment 2 due; optional extra session Tuesday at 11:30 AM in Communications B027. Jan 21: Martin Luther King Day (NO CLASS) Jan 23: Techniques for Developing Java applets that demonstrate data structures and algorithms: Aspects of Java's AWT and the LineApplet example. Jan 25: Performance Analysis [Sahni, Chapter 2]
4. Assignment 3 due Jan 28: Quiz 1 Jan 30: Asymptotic Notation [Sahni, Chapter 3] Feb 1: Performance Measurement [Sahni, Chapter 4]
5 Feb 4: Linear Lists [Sahni, Chapter 5] Feb 6: Applications of arrays and linear lists [Sahni, Chapter 6]; Linear Lists with Simulated Pointers; the UNION-FIND problem. Feb 8: Arrays, Stacks, and Queues [Sahni, Chapters 7-10]
6. Assignment 4 due Feb 11: The Image ADT Feb 13: Hashing [Sahni, Chapter 11] Feb 15: Binary Trees [Sahni, Chapter 12]
7 (Project plans due) Feb 18:  Presidents Day (NO CLASS) Feb 20: AVL Trees [Sahni, Chapter 16] Feb 22: B-Trees [Sahni, Chapter 16]
8. Assignment 5 due Feb 25: Graphs 1 [Sahni, Chapter 17] Feb 27: Graphs 2 [Sahni, Chapter 17] Mar 1: Quiz 2
9. Mar 4: Priority Queues and Heapsort Mar 6: (guest lecture) Mar 8: UNION-FIND ADT with up-trees [Sahni, pp486-497]
10 (Projects due March 13) Mar 11: A Reflection on the Dictionary ADT Mar 13: Demonstrations and Peer Evaluations Mar 15 (Last day of classes): Review
11 Mar 18: (no class)
Mar 20: FINAL EXAMINATION 2:30-4:20