COP3530, Data Structures Lectures
 August 26: Administrivia and Java Review
 Read Chapters 1  4, Sections 7.1 to 7.3, and the Appendix, most of which is review material.
 Dynamically expanding arrays and ArrayList (Section 2.4)
 StringBuffers (see TestString.java)
 August 28: Java Review Continued
 Nested, local, and anonymous classes (Section 4.7)
 Inner Classes (Section 6.2, 15.1, 15.2)
 Function Objects (Section 4.7)
 Supplement to Ch 4 code: CompareTestDefault.java
shows default comparator idea.
 Sept 2: The Collections API
 Read Chapter 6
 The Collections API
 Linked list review
 Sets
 Maps
 Iterators
 Sept 4: Algorithm Analysis
 Read Chapter 5
 BigOh
 Maximum subsequence sum examples
 Singleoperation costs
 Singly, and doubly linked lists
 Logarithms
 Binary search
 Sept 9, 16: Quiz and Assignment #2 Discussion
 Sept 18: Analysis of Algorithms Continued (from Sept 4)
 Sept 23 and 25: Recursion
 Read Sections 7.1 to 7.3 and 7.5
 Recursion basics
 Discussion of Assignment #3
 Divide and conquer (Section 7.5)
 Mergesort (Section 8.5)
 Sept 30, Oct 2, 7: Stacks, Queues, Linked Lists
 Oct 9 and 16: Binary search trees
 Insertion, find, deletion
 Oct 14: Midterm
 October 21: AVL Trees
 October 23 and 28: Dijkstra's Algorithm and Priority Queues
 Read Section 14.3
 Read Chapter 21
 Applet demo #1 (Dijkstra's algorithm)
 October 30, November 4 and 6: Separate Chaining Hash Tables
 Chapter 20 and 6.7.2.
 Discussion of Java 1.2 Collections API:
HashSet, HashMap, equals,
and hashcode
 November 6: Disjoint Sets
 Read Chapter 24, but stop before Section 24.6
 Nov 11: No class
 November 13: Minimum Spanning Trees
 Quiz
 Discussion of Assignment #6
 November 18, 20: Sorting
 Read Chapter 8
 Heapsort
 Quicksort
 Lower bounds for sorting
 November 25: Wrapup
 Last quiz
 Evaluations
 Any leftover material
 Review
 November 27: No class Thanksgiving
 December 2: Prefinal
 December 4: No class

Final Examination:
Finals Week.