CS 2604 Calendar - Summer 2000

This is a tentative schedule.

All dates and times are subject to change; such changes may be announced in class, via email, or posted to the web. Students are responsible for all information provided to them in these ways. This means that students must regularly check the CS 2604 homepage for announcements, check their email, and attend class.

 

Lecture Topic Reading Assignment Projected Date
Kruse Notes  
Introduction & Review   C00 July 3, 5
     
Linear Structures      
     General Lists C4: 112-126   July 5
     Stacks C4: 127-140 C01 July 6
     Queues     July 7
     
Algorithm Analysis      
     Definitions and Examples   C02 July 10
     
Asymptotics      
     Definitions and Theorems C7: 302-314 C03 July 11
     
Trees      
     Binary Trees C10: 429-443 C04 July 12, 13
     BSTs C10: 444-472 C05 July 14
     Balanced Trees C10: 473-514 C06 July 17
     Heaps C8: 363-364 C07 July 18
     
Sorting   C08 July 19 -- July 21
     Insertion Sort C8: 318-328    
     Theoretical Bounds C8: 336-338    
     Shell Sort C8: 333-335    
     HeapSort C8: 363-371    
     MergeSort C8: 344-351    
     QuickSort C8: 352-362    
     Radix Sort C9: 391-396    
     
Secondary Storage   C09 July 24
     Physical Characteristics      
     Access Times      
     Buffer Pools      
     
Midterm Test     July 26
     
Indexing I   Caa  
     Linear Indices C9: 380-386   July 27
     Hashing C9: 397-410   July 28
     Inverted Files C9: 386-388   July 31
     
External Sorting     August 1
     
Graphs   Cbb  
     Representation Schemes C12: 569-574   August 2
     Traversal Algorithms C12: 575-582   August 3
     Shortest Path C12: 583-586   August 3,4
     Minimal Spanning Trees C12: 587-593   August 4
          Prim's Algorithm      
          Kruskal's Algorithm      
     
Indexing II   Ccc  
     B trees C11: 535-555   August 7
     B+ trees     August 8
     Red-Black Trees C11: 556-565   August 9
     
Final Exam     August 11