CS4/531: Syllabus

  1. Prerequisite: 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).
  3. Outline of the course (dynamic)


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.