Introduction
This course presents the fundamental tools and technqiues in the design and analysis of algorithms. It will cover both traditional and emerging trends in algorithmics, including both theoretical and experimental evaluation. An approximate schedule of topics to be covered appears on the course web page (note that this is subject to change anytime). Make a habit to check this page for announcements.

Text
We will be using the following book as text: Introduction to Algorithms, by Cormen, Leiserson and Rivest, MIT Press / McGraw Hill. Many assignments and topics will be from the text, but I'll occasionally provide additional materials.

Class Format and Requirements

There will be three exams, covering all the material up to that point. There will be regular homework assignments; late homeworks will not be accepted. There will be occasional pop-quizzes on lecture material from the previous class, so it is in your best interest to attend all classes. Finally, there will be two programming assignments to be done in groups of 2 people. You are free to choose your partners; email your preferences to the TA. If no preference is given random assignemtns will be made. Graduate students (those that registered for 6967, may be asked to do extra questions on the exams).

The final grade will be determined as follows:
    50% exams (15%, 15%, 20% for exam I, II, and III, respv.)
    10% quizzes
    20% programming project
    20% homeworks

Academic Integrity
The school takes cases of academic dishonestly very seriously, resulting in an automatic "F" grade for the course if anyone is caught cheating. While students are allowed to discuss homework problems with other students, each student must turn in his/her own work.