image University of Washington Computer Science & Engineering
  CSE 421Su '12:  Approximate Schedule
  CSE Home   About Us    Search    Contact Info 

Schedule details will evolve as we go; check back periodically to see the latest updates.

    Due Lecture Topic Reading
Week 1
6/18-6/22
M   Intro, Examples & Complexity Ch. 1; Ch. 2
W Graph Algorithms Ch. 3
Week 2
6/25-6/29
M HW #1 (Due Th)
W Greedy Algorithms Ch. 4 (4.4-4.6 is review; omit 4.7,4.9)
Week 3
7/2-7/6
M HW #2 (Due Th)
W Holiday
Week 4
7/9-7/13
M HW #3 (Due Th) Divide & Conquer Ch. 5 (omit 5.6)
W
Week 5
7/16-7/20
M HW #4 (Due Th) Dynamic Programming Ch. 6 (omit 6.7-6.10)
W
Week 6
7/23-7/27
M HW #5 (Due Th) Network Flow 7.1-7.3, 7.5-7.6, 7.12
W
Week 7
7/30-8/3
M HW #6 (Due Th) NP-Completeness & Intractability Ch. 8 (omit 8.9, 8.10)
W
Week 8
8/6-8/10
M  
W
Week 9
8/13-8/17
M HW #7 NP Wrap up & Final Review
W   Final Exam  


CSE logo Computer Science & Engineering
University of Washington
Box 352350
Seattle, WA  98195-2350
(206) 543-1695 voice, (206) 543-2969 FAX