COP-3530, Data Structures Lectures
- August 29: Administrivia; Patterns, Part I
- Read Chapters 1 - 4 and 8, and the Appendix, all of which is COP-3337 material.
- View the Intermediate
Programming pages to see what I expect to have been covered.
- The Functor Pattern
- Code for the function objects pattern
- Rectangle.cpp
- August 31: Patterns, Part II
- The Wrapper Pattern
- Wrapping pointers to add comparison functionality
- The auto_ptr class template
- Sample code: autodemo.cpp illustrates the three patterns
- September 5: Patterns, Part III
- Wrapping constant references
- Code for the Set example
(note that it is uncommented):
- Cref.h (external dependency)
- Set.h (external dependency)
- Set.cpp (external dependency)
- Set_int.cpp (add to project)
- TestSet.cpp (add to project)
- September 7, 12, and 14: Another Pattern and STL
- Sep 19 and 21: Algorithm Analysis and Start of Sorting
- Read (book) Chapter 6, Section 8.5 (up to 8.5.2), and Section 9.5.
- Big-Oh
- Maximum subsequence sum examples
- Logarithms
- Binary search
- Mergesort
- Sep 26: Stacks and queues
- Sep 28: Unweighted shortest paths
- Scan the start of Chapter 15
- Oct 3: Time and Space
- Oct 10: STL Sequence Implementations
- Sections 3.4.2, 7.5, and 17.5
- The vector class implementation
- The list class implementation
- Oct 12: Binary search trees
- Oct 17: Midterm
- Oct 19: AVL trees
- Oct 24, 26, and 31: Hash tables
- Read Chapter 20
- Discussion of Assignment 3/4
- Discussion of Java 1.2 Collections API and hashcode
- Nov 2, 7, and 9: Priority Queues and Weighted Shortest Paths
- Read Chapter 21 and Section 15.3
- Discussion of Assignment #5
- November 14, 16, and 21: Sorting
- November 28 and 30: Disjoint Sets
- Read Chapter 24, but stop before Section 24.6
- December 5: Review
- December 7: No class
-
Final Examination: Tuesday December 12
- DAY CLASS: 12:30 - 3:10 PM
- NIGHT CLASS: 6:25 - 9:05 PM