Fundamental Algorithms, G22.1170
Fall 2002

COURSE INFORMATION

Instructor: Chee Yap
Contact: yap@cs.nyu.edu, (212) 998-3115
Office: Room 416, Warren Weaver Hall.
Lectures: Tue 5:00--7:00 in Room 109, Warren Weaver Hall.
Problem Sessions: Thu 6:00--7:00 in Room 109, Warren Weaver Hall.
Teaching Assistants: Ofer Gill (room 1005, 715 Broadway, #998-3351, gill@cs.nyu.edu)
Siddhartha Annapureddy (room 801, WWH, #998-3319, siddhart@cs.nyu.edu)
Office hours: YOU CAN ALWAYS MAKE AN APPOINTMENT FOR OTHER TIMES
Chee: Tue 11-12
Ofer: Mon 6-7, Thu 4-5
Siddhartha: Wed 4-5, Thu 5-6
Textbook: Cormen, Leiserson, Rivest and Stein
Introduction to Algorithms, Second Edition, McGraw-Hill 2001.
Exams and Homework: Regular homeworks, midterm and final exam. These weigh 50%, 15% and 35%, respectively. The course grade is based on a curve.
MIDTERM will be Oct 20 or 21. Final Exam is in the week of Dec 16-23.
Prerequisites: Knowledge of programming in a high-level language. Basic data structures such as linked lists and binary trees. Some discrete mathematics such as induction and graphs.
Class Homepage: Book mark this at once!
http://cs.nyu.edu/~yap/classes/funAlgo/
Class Email List: You must join the class email list as soon as available.
Please click here for instructions.

NOTES