Also note the dates here were planned with a MWF section in mind; there will be at least slight variations for a TTh section.
Lecture Topic  Reading Assignment  Projected for:  
Drozdek  Notes  
Introduction & Review  1.1  1.9  Admin  Jan 19 
Math Review  Jan 19  21  
Linear Structures  
General Lists  3.1  3.3  Linear Structures  Jan 21 
Stacks  4.1  Linear Structures  Jan 23 
Queues  4.2, 4.3  Linear Structures  Jan 23 
Skip Lists  3.4  Skip Lists  Jan 26 
Binary Trees  
Binary Trees  6.1  6.2  Binary Trees  Jan 28  30 
BSTs  6.3  6.6  Binary Search Trees  Jan 30  Feb 4 
Balanced Trees (splaying)  6.8  Feb 4  
AVL Trees  6.7.2  AVL Trees  Feb 6  Feb 9 
Algorithm Analysis  Algorithm Analysis  Feb 11  13  
Asymptotics  2.1  2.8  Asymptotics  Feb 16  Feb 18 
Secondary Storage  Secondary Storage  
Physical Characteristics  Feb 20  
Access Times  Feb 20  
Buffer Pools  Feb 20  Feb 25  
Binary File I/O  Binary File I/O  Feb 27  Mar 1  
Midterm Test  Mar 4 & Mar 5  
Spring
Break


Heaps  6.9  Heaps  Mar 15 
Indexing I  
Linear Indices  3.6  Tables  Mar 27 
Hashing  10.1  10.4  Hashing  Mar 29  Mar 31 
Selforganizing Lists  3.5  Selforganizing Lists  Apr 2 
Sorting  Sorting  
Insertion Sort  9.1  Apr 5  
Theoretical Bounds  9.2  Apr 5  
Shell Sort  9.3.1  Apr 7  
HeapSort  9.3.2  Apr 7  
MergeSort  9.3.4  Apr 9  
QuickSort  9.3.3  Apr 9  
Radix Sort  9.3.5  Apr 12  
Indexing II  Tree Indexing  
B trees  7.1.1  Apr 14  
B+ trees  7.1.3  Apr 14  Apr 16  
RedBlack Trees  Apr 19  
External Sorting  External Sorting  Apr 21  
General Trees  General Trees  Apr 23  
Graphs  Graphs  
Representation Schemes  8.1  Apr 26  
Traversal Algorithms  8.2  Apr 28  
Shortest Path  8.3  Apr 28  Apr 30  
Minimal Spanning Trees  
Prim's Algorithm  Apr 30  
Kruskal's Algorithm  8.5.2  May 3  
Classes End  May 5  
Final Exam 


Tues, May 11 1:05  3:05 