CSCI 3394 - Schedule

This page is a lot more fun if you have Java 5.0 installed. You only need the JRE.
Syllabus Links Schedule Grades

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
1-12 Introduction CLR 3, 4, KT 2  
1-17 Linked Structures and Balanced Trees CLR 10, 12, 13  
1-19 Augmented Data Structures CLR 14 Test #1
1-24 Searching Solution Space and Divide and Conquer   Assignment #1
1-26 (No Class) KT 5  
1-31 Heaps CLR 6  
2-2 Binomial Heaps CLR 19 Test #2
2-7 Greedy Algorithms CLR 16, KT 4 Assignment #2
2-9 Greedy Algorithms 2 CLR 24, 25  
2-14 Fibonacci Heaps CLR 20  
2-16 Memoization   Test #3
2-21 Dynamic Programming CLR 15, KT 6 Assignment #3
2-23 Dynamic Programming 2    
2-28 Disjoint Sets CLR 21  
3-2 SIGCSE (No Class)   Test #4
3-7 Graphs 1 CLR 22, 23, KT 3 Assignment #4
3-9 Single-Source Shortest Path CLR 24  

3-14

 Spring Break    
3-16 Spring Break    
3-21 All-Pairs Shortest Path CLR 25 Assignment #5
3-23 Maximum Flow CLR 26, KT 7  
3-28 HS Prog Comp Mockup    
3-30 NP-Completeness CLR 34, KT 8 Test #5
4-4 Matrix Operations and Linear Programming CLR 28, CLR 29 Assignment #6
4-6 More Linear Programming CLR 29  
4-11 Finishing Linear Programming CLR 29  
4-13 Computational Geometry CLR 33 Test #6
4-18 Computational Geometry CLR 33  
4-21 Approximation Algorithms CLR 35, KT 11  
4-25 Approximation Algorithms   Assignment #7
4-27 Conclusions and something else   Test #7