Course page for CS2443 - Algorithms

Back to my homepage
Course Instructors: N.R.Aravind and Subrahmanyam Kalyanasundaram .
Click here for a pdf version of syllabus and grading policy.

Syllabus (Approx):

Section I: Divide & Conquer, Sorting, and order statistics, Fast Fourier Transform, randomized sorting and selection, closest pair-of-points algorithms.
Section II: Dynamic programming: Edit distance, Viterbi algorithm, and other examples. Greedy algorithms: Minimum change, Huffman codes, and other examples.
Section III: Graph algorithms: DFS, topological sorting, shortest path algorithms, maximum flow.
Other/optional topics: NP-completeness.

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:

Attendance: 10%, Assignments: 10%
Exam 1: 20%, Exam 2: 20%, Exam 3: 40%
Attendance Policy:
21 out of 42 classes NECESSARY to pass the course.
Marks: 5 for 21 classes, 8 for 28 classes, 10 for 35 classes.

Academic Honesty Policy