Instructor. Prof. Yu Chen, Warren Weaver Hall (Ciww), Room 1126. Tel: 998-3285, firstname.lastname@example.org
Lecture: 9:55 a.m.-11:10 a.m., Mon/Wed, room 102, Warren Weaver Hall (Ciww)
Problem session: 11:55 a.m. - 1:10 p.m. Tuesday, room 102, Ciww
First meeting: Wednesday, September 8.
Last day of class: Monday, December 13.
Office Hours. 2:00 p.m. - 4:00 p.m. Monday, and by appointment.
Syllabus. 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.
Required Text. Data Structures and Algorithm Analysis in
Ada, by Mark Allen Weiss; available at the university bookstore.
Basic Course Information
handout on recurrence equations
email@example.com (Yu Chen)
Last modified: Dec. 7, 1999