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

Final Exam
2:30-4:20 Monday, March 16, 2015


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