Professor Chee Yap
Chee Yap ,
Room: WWH 301, Tel: 998-3115,
email: yap "at" cs.nyu.edu
| Teaching Assistant,
|| Marc Millstone,
Room: WWH 530, Tel: (212)998-3293
email: millstone "at" cims.nyu.edu
||Chee: Mon 4-5, Tue 5-6 and
|Thu 4-5 Thu 3:30-4:30, and by appointment.
Marc: Tue 2-3, and by appointment.
||Wed 5:00-6:50, WWH 109
||Mon 5:00-5:50, WWH 109
|| No late homework.
With valid excuse, we have the option of imposing a penalty.
|| Course Grade is curved:
Class Participation (5%)
Written Homework (40%),
|| Midterm will be held in class on
March 10, starting at 4:45pm.
T.A.'s extra office hrs (week of Mar 3):
Tue 5-6, Wed 4-5, Thu 5:40-6:55.
FINAL EXAM will be held in class,
on the first class day (May 7) of exam period.
|| This course has no programming.
| NYU Bboard
||Class discussions, email lists, announcements, check grades, etc.
Use your NYU NetID to login, then click our class link
| Academic Integrity
-- please read this!
Do two things immediately:
(1) bookmark this page that you are looking at, and
(2) login into our course
page in NYU Bboard, following
All information for this course will come from these two links.
for a rough outline of the course syllabus.
PREREQUISITE: An undergrad course in
discrete mathematics. One year's experience in
some high-level computer language and familiarity with
recursive programming and basic data structures (arrays, pointers,
stacks, queues, linked lists, binary trees).
This course emphasizes analysis, correctness and efficiency of
algorithms. As such, it is relatively mathematical
and rigorous. Students are expected to work hard on this.
An important aspect of analysis is
on solving recurrences.
You will learn asymptotic notations (Big-Oh, etc).
Basic algorithms to know include
balanced binary trees,
sorting and selection,
hashing, graph traversal,
breadth-first and depth-first searches,
Computational techniques include
greedy method, and
Depending on time, we add some advanced topics such as:
primality and cryptographic applications,
The capstone of the course is a brief introduction
to NP-Completeness Theory.
Lecture Notes and Textbook
I will use my own lecture notes, which are
available for download from this website.
Although I do not require a textbook, many students find it
helpful to read from a text book.
I highly recommended the following book:
Introduction to Algorithms (2nd Edition)
by Cormen, Leiserson, Rivest and Stein, 2002,
from the MIT Press and McGraw-Hill Book Co.
The viewpoint of this text book (known as [CLRS]) is
consistent with my lecture notes. In fact, most of my lectures
have a matching chapter in [CLRS].
It is a THICK book, but if you become somewhat familiar
with it, it will serve nicely as your algorithms
reference on your bookshelf!
Some Useful Links
Feel free to send me links related to our topic,
and I will post them here.
Here are some links from the past.
Book on Discrete Math
Students often ask for recommendations for
a book on for mathematical background, including discrete math.
The following book seems to be well written:
``Discrete Mathematics with Applications'',
by Susanna S. Epp,
Wadsworth Group/Thomson Learning, Second Edition, 1995.
Dictionary of Algorithms and Data Structures
The following is a link to NIST's
"Dictionary of Algorithms and Data Structures" page.
Minimal Perfect Hashing