CSE 421: Introduction to Algorithms, Autumn 2008

CSE Home

CSE 421 Home

About Us

Search

Contact Info

< /tr> < /tr> < /tr> < /tr> Email   Archive    Sign-up Instructions Homework Assignments   Assignment 1   Assignment 2   Assignment 3   Assignment 4   Assignment 5   Assignment 6   Assignment 7   Assignment 8 Reading Assignments   Chapter 1   Chapter 2   Chapter 3   Chapter 4, Sections 4.1-4.7   Chapter 5   Section 13.5   Algebraic Divide and Conquer   Chapter 6   Sections 7.1-7.3, 7.5, 7.6, 7.11   Chapter 8 Lecture Notes   Stable Matching   Overview   Graph Traversal   Greedy Algorithms   Divide and Conquer   Dynamic Programming   Network Flow   NP & NP-Completeness   Dealing with NP-Completeness   Backtracking for SAT Administrative   Course Calendar   Grading Guidelines   Midterm Topics   Final Exam Topics Useful Links   SB Algorithm Repository

MWF 1:30-2:20    JHN 111 Office Hours Location Phone Instructor: Paul Beame   beame@cs   MW 2:20-3:00 and by appointment CSE 668 543-5114 TAs: Widad Machmouchi widad at cs TTh 2:30-3:20 CSE 216 Alex Jaffe ajaffe at cs Th 12:30-1:20 CSE 216 Grading: Homework 45-55%, midterm 15-20%, final 30-35%, give or take. Extra Credit. Homework: There will be 8 roughly weekly homework assignments, due on Fridays early in the quarter. Please read the grading guidelines to help you understand what is expected on your homework. Textbook Algorithm Design by Jon Kleinberg and Eva Tardos, Addison-Wesley, 2006. We will cover almost all of chapters 1-8 of the Kleinberg/Tardos text. In addition, I will borrow a small amount of material on divide and conquer algorithms from Introduction to Algorithms: A Creative Approach, by Udi Manber, Addison-Wesley 1989. I will hand out extra material for this. Another handy reference is Steven Skiena's Stonybrook Algorithm Repository which is also listed in the Useful Links section on the left column of this page. Mailing List: There is a class mailing list, cse421@cs.washington.edu. Follow the link in the left column on this page to sign up. Everyone is expected to be reading cse421 e-mail to keep up-to-date on the course. Midterm Exam: Monday Nov 3 in class. This will be open book and open notes. Midterm Topics There will be a review session Sunday Nov 2 from 4:30-5:00 in EEB 037. Old Sample Midterm Sample Midterm Solution Final Exam: Monday, December 8, 2:30-4:20 p.m. This will be open book and open notes. Final Exam Topics  Old Final Exam  Practice Final  Solutions to Practice Final Suggestions or Comments? You can send comments to the instructor or TA using this anonymous feedback form 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. Prerequisite: CSE 322; CSE 326. 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-2008, Department of Computer Science and Engineering, University of Washington.