Professor. Vijaya Ramachandran (vlr@cs, TAY 3.152, 471-9554).
Office Hours. Mondays 3:30-4:30 and Thursdays 2-3.

Teaching Assistant. Dan Fernholz (fernholz@cs).
TA Office Hours. Tuesdays 2-3 and Wednesdays noon-1 in TAY 3.144.

Textbook. T.H. Cormen, C.E. Leiserson, R.L. Rivest, Introduction to Algorithms, McGraw-Hill, New York, NY, Second Edition, 2001.

A list of known errata and bugs can be accessed from http://mitpress.mit.edu/algorithms/index.html

Grading. The course grade will be based on 5 homework assignments (worth totally 25%), an in-class test (worth 20%), a take-home test (worth 20%), and a final exam (worth 35%).

Homework assignments. Each homework assignment will have several problems, of which two will be designated as problems to be handed in. You should work out the remaining problems on your own, without handing them in. Solutions should be presented in a clear and concise manner.
Homework solutions are due at the beginning of class on the due date.

Guidelines for homework assignments. Students may discuss the problem sets with one another, but solutions must be written up separately. Each problem should be accompanied by a statement on the individuals with whom the problem was discussed. If a key idea was obtained from another book or paper (other than the course textbook), then the source of that idea should be cited. If no outside source was consulted, then a statement to this effect should be made.

Take-home test. No discussion of any sort is allowed on the take-home test. You may consult your textbook, class handouts and personal notes, but not any other source.

The in-class test and final exam will contain some problems from the homeworks and class notes as follows:

• Approximately a third of the credit in each of them will be based on the homework assignments.
• Another third of the credit will be based on material from class notes.
• The last third will be based on new problems.