Course page for CS202 - Design & Analysis of Algorithms

Back to my homepage

Syllabus (Approx):

Section I: Divide & Conquer, sorting, order statistics, Fast Fourier Transform, randomized sorting and selection.
Section II: Dynamic programming: edit distance and other examples. Greedy algorithms: Minimum change, Huffman codes, and other examples.
Section III: Graph algorithms: DFS, topological sorting, shortest path algorithms, maximum flow.

Asymptotic notation in six easy pieces: one two three four five six

References:

1. Introduction to Algorithms: Cormen, Leiserson, Rivest and Stein
2. Online lecture notes by Jeff Erickson
3. Algorithms by Dasgupta, Papadimitrou and Vazirani
4. Algorithm Design: Kleinberg and Tardos
5. The Algorithm Design Manual by Steven Skiena

Grading Policy:

Weekly Quizzes: 20%, Programming Assignments: 20%
Exam 1: 20%, Exam 2: 20%, Exam 3: 20%

Academic Honesty Policy