Lecture: TTh, 12:30-1:50, 205 NSM

Recitation (choose one):

Dr. Russ Miller's Office Hrs.: Tues, 2:30-3:30

T.A.: C.-W. Lee




  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 40% of your grade.
  2. Final exam will account for 60% of your grade.
  3. Homeworks will be graded, but will not factor into your final course grade.


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

Russ Miller

Copyright © 1997-1998 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.