Basic Algorithms (Honors)
V22.0310.001
Fall 1999

Instructor. Prof. Yu Chen, Warren Weaver Hall (Ciww), Room 1126. Tel: 998-3285, yuchen@cims.nyu.edu

Class Time.
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

Homework Assignments

  • Homework and exam schedule
  • A C function for timing in (most) Unix systems
  • Download sample midterm in postscript format or in pdf format
  • Download midterm in postscript format or in pdf format
  • Download paper catalan.pdf as a reference to the project.
  • numerical result of the project.
  • Download sample final in postscript format or in pdf format

    • Reading

  • 9/08 - 9/13: Chapters 1, 2 of Weiss' textbook
  • 9/15 - 9/20: Chapter 3 of Weiss' textbook
  • 9/22 - 9/29: Chapter 4 of Weiss' textbook,
    handout on recurrence equations
  • 10/04 - 10/6: Chapters 5 of Weiss' textbook
  • 10/11 - 10/18: Chapters 6 of Weiss' textbook
  • 10/20 - 11/8: Chapters 7 of Weiss' textbook
  • 11/8 - 11/15: Chapters 8 of Weiss' textbook
  • 11/15 - 11/24: Chapters 9 of Weiss' textbook
  • 11/24 - 12/6: Chapters 10 of Weiss' textbook

    • yuchen@cims.nyu.edu (Yu Chen)
    Last modified: Dec. 7, 1999