CSc 445 ( Spring 2006 ) : Slides

Schedule and topics are subject to changes.
Date Download File
8/20 Introduction.
9/14 Augmented Data Structures
9/14 Hash tables
9/18 Dynamization of structures
9/18 Splay Trees
9/25 Binomial Heaps
9/27 Potential Functions (from the board)
10/4 Fibonacci Heaps
10/4 String Matching: Finding a pattern in a text.
10/4 Finding the Closest Pair
10/17 Dynamic Programming.
10/24 Single Source Shortest Path, (material for the exam starts here).
10/24 Tries and Suffix Tries.
11/15 Quad Trees
11/15 Network Flow.
11/27 Linear Programming.
12/4 Stable Marriage Algorithm, (not included in the material for the exam)

[ Top| Home | Department ]