UW Logo

CS 341 Home Page


Home People Resources Marking Assignments Exams Schedule

Course Description

This course covers the basics of Algorithms: how to design algorithms, how to analyze and improve their efficiency, and how to know when no further improvements are likely.

After a brief review of aymptotic notation and basic analysis of algorithms, the course covers some fundamental algorithmic paradigms: greedy algorithms, divide-and-conquer, and dynamic programming. We then discuss exploration of graphs, and finally turn to lower bounds, NP-completeness, and approximation algorithms.


Office hours for the week of Dec. 13-17 are as follows:
This page is maintained by the CS 341 course personnel.