Basic Algorithms
V22.0310.001
Spring 1999
Professor Leslie Greengard

Tuesday and Thursday 2:50-4:05
Warren Weaver Hall, Room 109


Basic Course Information


Reading :

  • 1/19 - 1/21: Chapters 1, 2 of Weiss' textbook
  • 1/26 - 1/28: Chapter 3 of Weiss' textbook
  • 2/02 - 2/04: Chapter 4 of Weiss' textbook, handout on recurrence equations
  • 2/09 - 2/11: Chapters 4, 5 of Weiss' textbook
  • 2/16 - 2/18: Chapters 5, 6 of Weiss' textbook
  • Homework Assignments:

  • Homework and exam schedule
  • A C function for timing in (most) Unix systems

  • FINAL on May 11
    Covers: Chapters 1-6 briefly
    Covers: 7.1-7.3, 7.5-7.7, 7.10, 8.1-8.5
    Covers: 9.1-9.3, 9.5 (Kruskal), 9.6 (but not the details of the
    biconnectivity or strong components algorithms)
    Covers: 10.1-10.3 (main ideas, not detailed examples from text).
    Download sample final in pdf format