COURSE INFORMATION

COURSE HOME PAGE URL http://cs.nyu.edu/courses/spring99/V22.0310.001/index.htm
You can also find this from links in the CS department home page.
COURSE NAME: Basic Algorithms
OFFERING: Spring 1999
TIME: Tuesday and Thursday 2:50-4:05
PLACE: Warren Weaver Hall, Room 109
TEACHER: Professor Leslie Greengard, Office: WWH 1116,
Phone: (212)998-3306, Email: greengard@cims.nyu.edu
OFFICE HOURS: Tuesday & Thursday 4:15-5:15
PREREQUISITE: Data structures (V22.0102) and Discrete Math (V63.0020)
TEXTBOOK: Data Structures and Algorithm Analysis
by Mark Allen Weiss
EXAMINATIONS: quiz (20%) midterm (30%) and final (40%)
HOMEWORK: Approx every two weeks (10%). No late homework.
LAST DAY OF CLASSES: Thursday, April 29
FINAL EXAM: TBA

DESCRIPTION

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.