CSE 417: Algorithms & Computational Complexity

Winter 08

Basic Info

Lecture: MWF 2:30 - 3:20 Low 101
Web Page: http://www.cs.washington.edu/417
Mailing list: https://mailman.cs.washington.edu/mailman/listinfo/cse417

Course Staff

Instructor: Imran Rashid, Allen Center 210, irashid [at] cs.washington.edu, 206-616-1246
   Office Hours: M 11-12, Th 11-12:30 and by appointment
TA: Ioannis Giotis, giotis [at] cs.washington.edu
   Office Hours: W 3:30-4:30, Allen Center 220

Catalog Description

Design and analysis of algorithms and data structures. Efficient algorithms for manipulating graphs and strings. Fast Fourier Transform. Models of computation, including Turing machines. Time and space complexity. NP-complete problems and undecidable problems.

Prerequisite

CSE 373

Credits

3