| COURSE HOME PAGE | URL http://cs.nyu.edu/courses/fall99/V22.0310.001/index.htm |
| CLASS MAILING LIST | v22_0310_001_fl99@cs.nyu.edu |
| COURSE NAME | Basic Algorithms (Honors) |
| OFFERING | Fall 1999 |
| TIME | Monday and Wednesday 9:55 a.m.-11:10 a.m. |
| PLACE | Warren Weaver Hall (Ciww), Room 101 |
| RECITATION | Tuesday 11:55 a.m. - 1:10 p.m. Ciww 101. |
| TEACHER |
Professor Yu Chen, Office: Ciww 1126,
Phone: (212)998-3285, Email: yuchen@cims.nyu.edu |
| OFFICE HOURS | Monday 2:00 p.m. - 4:00 p.m., and by appointment |
| PREREQUISITE | Data structures (V22.0101) and Discrete Math (V63.0020) |
| TEXTBOOK |
Data Structures and Algorithm Analysis in Ada
by Mark Allen Weiss |
| EXAMINATIONS | midterm (30%) and final (40%) |
| HOMEWORK | every week or two weeks (30%). No late homework. |
| LAST DAY OF CLASSES | Monday, December 13 |
| MIDTERM | Wednesday, October 20, 10:00-11:45am, Ciww 101 |
| FINAL EXAM | Wednesday, December 15, 10:00-11:50am, Ciww 109 |
This course will study the fundamentals of data structure and algorithm design, including methods for determining the (asymptotic) running time of algorithms. Topics to be covered include: order of magnitude, recurrence relations, balanced trees, graph algorithms, divide and conquer algorithms, dynamic programming.