image University of Washington Computer Science & Engineering
  CSE 421Su '13:  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/24-6/28
M   Intro, Examples Ch. 1
W Complexity Ch. 2; (2.5 should be review; skim it, reading unfamiliar parts more carefully.)
Week 2
7/1-7/5
M HW #1 (Due F) Graph Algorithms Ch. 3
W
Week 3
7/8-7/12
M HW #2 (Due F) Greedy Algorithms Ch. 4 (4.4-4.6 is review; omit 4.7,4.9)
W
Week 4
7/15-7/19
M HW #3 (Due F) Divide & Conquer Ch. 5 (Omit 5.6)
W
Week 5
7/22-7/26
M HW #4 (Due F) Dynamic Programming Ch. 6 (Omit 6.7-6.10)
W
Week 6
7/29-8/2
M HW #5 (Due F) Network Flow Ch. 7.1-7.3, 7.5-7.6, 7.12
W
Week 7
8/5-8/9
M HW #6 (Due F) NP-Completeness & Intractability Ch. 8 (Omit 8.9, 8.10)
W
Week 8
8/12-8/16
M HW #7 (Due F)
W
Week 9
8/19-8/23
M   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