Tentative Syllabus

1. Prerequisite: A course in Advanced Data Structures
2. Students should know, and are responsible for, the material in chapters 1-13. In addition, students are also responsible for material on balanced trees (e.g., AVL, Red/Black, B-trees).
3. Topics to be covered:
   • Brief review of asymptotic notation
   • Brief review of Divide-and-Conquer
   • Dynamic Programming (chapt. 16)
   • Greedy Algorithms (chapt. 17)
   • Graph Algorithms (chapts. 23-26)
   • Computational Geometry (chapt. 35)
   • Parallel Algorithms (Chapt. 30)