CS 6043 Design and Analysis of Algorithms II (Spring 2012)

Prerequisites:

CS6033 (Design and Analysis of Algorithms I) or equivalent. Familiarity with basic sorting/searching algorithms and data structures, recurrence relations, and asymptotic notation will be assumed.

Regularly check the following for the latest updates:

Grader: Huilin Chen (hchen16@students.poly.edu).

Syllabus: Postscript PDF

Homework 1: PDF Postscript

Note: If you cannot print out either postscript or PDF format, please download the Adobe Acrobat PDF viewer. This program is available free at this site. Or you can download a postscript viewer from this site. If you are using the Unix machines on campus under X Windows, then you should be able to handle these formats, without additional software, using either ghostview or acroread.

Last update: 2/6/12