|Contact:||yap "at" cs.nyu.edu, or (212) 998-3115|
|Office:||Room 416, Warren Weaver Hall.|
|Lectures:||Thu 5:00--6:50 in Room 109, Warren Weaver Hall.|
|Recitation:||Wed 6:00--7:00 in Room 109, Warren Weaver Hall.|
Vikram Sharma (sharma "at" cs.nyu.edu, Room 420 WWH, http://cs.nyu.edu/~sharma/, Office: #998-3490.
Sung-Hee Lee (leesh "at" cs.nyu.edu, Room 1215 of 719 Broadway, Office: #998-3376)
Chee: Wed 4-5
Sharma: Thu 4-5 and 7-8.
Sung-Hee: Tue 4-5 and 7-8.
Please try to make these hours, and make an appointment for other times.
I will hand out my own Lecture Notes.
It should be sufficient for this course.
Recommended (but not required) Textbook: For supplementary reading, we recommend Introduction to Algorithms, Second Edition, McGraw-Hill 2001 by Cormen, Leiserson, Rivest and Stein. Most of our lecture notes will have a corresponding chapter in this recommended textbook.
In fact, this book is online from www.books24x7.com. Since NYU Library subscribes to this, you can access the book from many NYU computer (in particular, go to your account in home.nyu.edu, click under ``research''). Note that you are not allowed to download the book.
|Exams and Homework:||
Regular homeworks, midterm and final exam. These
weigh 45%, 15% and 40%, respectively.
The course grade is based on a curve.
Midterm will be on Thu Oct 20th, in class.
Final Exam will on Thu Dec 22, 5-7pm in class.
|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!
If you are registered for this class, you are automatically
enrolled in the NYU Bboard for this course.
The Bboard provide some useful functions such
as class discussion forum, class mailing list
and individual grades lookup.
To get to NYU Bboard, point your browser at http://classes.nyu.edu and log in using your NYU NetID and NYUHome password. You can also log into your account at http://home.nyu.edu and click under "academics".