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

 Schedule & Reading
 Midterm Review
 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:
 8:  P & NP
Lecture Recordings

Lecture:  MGH 241 MWF 2:30- 3:20 
Office Hours Location Phone
Instructor:  Larry Ruzzo, ruzzocs  F 3:30- 4:30  CSE 554  206-543-6298
TAs:  Wenbo Cui, wenboccs  W 4:00- 5:00  CSE 220 
  Daniel C Jones, dcjonescs  M 1:00- 2:00  CSE 220 
  Saidutt Nimmagadda, nimmascs  Th 1:00- 2:00  CSE 021 
  Qian (Will) Yan, qiany7cs  Th 4:30- 5:30  CSE 021 
  Xin Yang, yx1992cs  Tu 3:30- 4:30  CSE 503 

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

Discussion Board: Also feel free to use Catalyst GoPost to discuss homework, etc.

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: CSE 312; CSE 332

Credits: 3

Grading: Homework, Midterm, Final. Homework will be a mix of paper & pencil exercises and programing. Overall weights 55%, 15%, 30%, roughly.

Late Policy: Unless otherwise announced, homework is due at the start of class on the due date. 20% off per day thereafter (business day, e.g., Monday for Friday due dates).

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.

Collaboration: Homeworks are all individual, not group, exercises. Discussing them with others is fine, even encouraged, but you must produce your own homework solutions. Follow the "Gilligan's Island Rule": if you discuss the assignment with someone else, don't keep any notes (paper or electronic) from the discussion, then go watch 30+ minutes of TV (Gilligan's Island reruns especially recommended) before you continue work on the homework by yourself. You may not look at other people's written solutions to these problems, not in your friends' notes, not in the dorm files, not on the internet, ever. If in any doubt about whether your activities cross allowable boundaries, tell us before, not after, you turn in your assignment. See also the UW CSE Academic Misconduct Policy, and the links there.

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-2017, 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