image University of Washington Computer Science & Engineering
  CSE 421Su '13:  Introduction to Algorithms
  CSE Home   About Us    Search    Contact Info 

 Schedule & Reading
 Final Review
Lecture Notes
 1:  Overview & Example
 2:  Analysis
 3:  Graphs, B/DFS
 4:  Greedy:
 5:  Divide & Conquer
 6:  Dynamic Programming:
   Sched & Knapsack
   RNA Structure
   String Alignment
 7:  Max Flow
   Edmonds-Karp-Dinitz example
 8:  P & NP
Lecture Recordings
 1: Help
 2: Jun 26  [get .zip]
 4: Jul 3  [get .zip]
 5: Jul 8  [get .zip]
 7: Jul 15  [get .zip]
 8: Jul 17  [get .zip]
 9: Jul 22  [get .zip]
 11: Jul 29  [get .zip]
 12: Jul 31  [get .zip]
 13: Aug 5  [get .zip]
 14: Aug 7  [get .zip]
 15: Aug 12  [get .zip]
 16: Aug 14  [get .zip]

Lecture:  EEB 026 (schematic) MW 10:50- 12:20 
Office Hours Location Phone
Instructor:  Larry Ruzzo, ruzzocs  M 2:00- 3:00  CSE 554  206-543-6298
TA:  Cyrus Rashtchian, cyrashcs  W 2:00- 3:30  CSE 220 

Course Email: Staff announcements and general interest student/staff Q&A about homework, lectures, etc. The instructor and TA are subscribed to this list. Enrolled students are as well, but probably should change their default subscription options. Messages are automatically archived. 

Catalog Description: Techniques for design of efficient algorithms. Methods for showing lower bounds on computational complexity. Particular algorithms for sorting, searching, set manipulation, arithmetic, graph problems, pattern matching.

Prerequisites: either CSE 312 or CSE 322; either CSE 326 or CSE 332.

Credits: 3

Grading: Homework, Final. Homework will be a mix of paper & pencil exercises and programing. Overall weights 60%, 40%, roughly.

Late Policy: Unless otherwise announced, 20% off per calendar day after the due date. (Outside of class, you may turn in work during office hours, or electronically, as described on the assignment sheets. Don't email them.)

Extra Credit: Assignments may include "extra credit" sections. These will enrich your understanding of the material, but at a low points per hour ratio. Do them for the glory, not the points, and don't start extra credit until the basics are complete.

Textbook: Algorithm Design by Jon Kleinberg and Eva Tardos. Addison Wesley, 2006. (Available from U Book Store, Amazon, etc.)

Portions of the CSE 421 Web may be reprinted or adapted for academic nonprofit purposes, providing the source is accurately quoted and duly credited. The CSE 421 Web: © 1993-2013, the Authors and the Department of Computer Science and Engineering, University of Washington.

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