CSCI 3394  Schedule
This is the schedule for CSCI3394  Advanced Algorithms and Data Structures during Spring 2006. The table
below lists what we will be discussing in each class meeting as well as the
required readings and the due dates for assignments, quiz dates, and test
dates.
Date 
Topics 
Readings 
Due Dates 
112 
Introduction 
CLR 3, 4, KT 2 

117 
Linked Structures and Balanced Trees 
CLR 10, 12, 13 

119 
Augmented Data Structures 
CLR 14 
Test #1 
124 
Searching Solution Space and Divide and Conquer 

Assignment #1 
126 
(No Class) 
KT 5 

131 
Heaps 
CLR 6 

22 
Binomial Heaps 
CLR 19 
Test #2 
27 
Greedy Algorithms 
CLR 16, KT 4 
Assignment #2 
29 
Greedy Algorithms 2 
CLR 24, 25 

214 
Fibonacci Heaps 
CLR 20 

216 
Memoization 

Test #3 
221 
Dynamic Programming 
CLR 15, KT 6 
Assignment #3 
223 
Dynamic Programming 2 


228 
Disjoint Sets 
CLR 21 

32 
SIGCSE (No Class) 

Test #4 
37 
Graphs 1 
CLR 22, 23, KT 3 
Assignment #4 
39 
SingleSource Shortest Path 
CLR 24 

314

Spring Break 


316 
Spring Break 


321 
AllPairs Shortest Path 
CLR 25 
Assignment #5 
323 
Maximum Flow 
CLR 26, KT 7 

328 
HS Prog Comp Mockup 


330 
NPCompleteness 
CLR 34, KT 8 
Test #5 
44 
Matrix Operations and Linear Programming 
CLR 28, CLR 29 
Assignment #6 
46 
More Linear Programming 
CLR 29 

411 
Finishing Linear Programming 
CLR 29 

413 
Computational Geometry 
CLR 33 
Test #6 
418 
Computational Geometry 
CLR 33 

421 
Approximation Algorithms 
CLR 35, KT 11 

425 
Approximation Algorithms 

Assignment #7 
427 
Conclusions and something else 

Test #7 