Assignments

CSE 415: Algorithms and Computational Complexity The University of Washington, Seattle, Winter 2013

Assignment 1: The Gale-Shapley algorithm, review of big-O notation.   Assignment 2: Graph Algorithms: Theory and Practice.   Assignment 3: Greedy Algorithms and Huffman Data Compression   Assignment 4: Dynamic Programming   Project: An in-depth theoretical or implementational study, from a given set of options.   Assignment 5: FFTs, NP, and NP-Complete Problems