Lecture: TTh, 12:30-1:50, 218 Norton

Recitation (choose one):

Dr. Russ Miller's Office Hrs.: T, 9-10 & 2:30-3:30




  1. CS531 is a graduate-level course in Analysis of Algorithms that is required of all graduate students in the Department of Computer Science.
  2. CS431 is an undergraduate-level course in Algorithms that serves as an elective for undergraduate students at the University at Buffalo.


  1. A course in Advanced Data Structures
  2. Students should know, and are responsible for, the material in chapters 1-13 of Introduction to Algorithms, by Cormen, Leiserson, and Rivest. In addition, students are also responsible for material on balanced trees (e.g., AVL, Red/Black, B-trees).

Reading Material:

Grading Policy:

  1. Midterm exam will account for 25% of your grade.
  2. Final exam will account for 40% of your grade.
  3. Homeworks will account for 35% of your grade.
  4. If you pass both the Exam Portion and the Non-exam Portion of the course, then your course grade will be the (weighted) average of these two letter grades. If you fail either portion of the course, you will receive an F in the course.
  5. Graduate students will be graded separately and on a different scale from undergraduate students.

Assignments must be submitted before the beginning of class on the day they are due.

This will be a paper and pencil course. There will be no programming assignments.

Recitation is required. New and supplementary material will be presented in recitation sections.


Disclaimer: I reserve the right to change any part of this tentative syllabus at any time.

Russ Miller

Copyright © 1996-1997 by Russ Miller.

All rights reserved. No part of this document may be used in any form by any electronic or mechanical means without permission in writing by the author.