COP3530, Data Structures Lectures
 August 24 and 26: Administrivia; C++ review
 Here is a concise C++ Review for this course.
READ EVERY SENTENCE OF THIS AT LEAST FOUR TIMES.
 Read Chapters 1  3 and the Appendix.
 View the Intermediate
Programming pages to see what I expect to have been covered.
 Aug 31, Sep 2, 9, and 14: Algorithm Analysis
 Read Chapter 5 and Section 7.5 (up to 7.5.2).
 Mergesort, from Ch 8.
 Slides from 1996 (uses Java, covers more than I did so far)
 September 16 and 28: Stacks and Queues
 Read Sections 6.2, 6.3, 11.1, Chapter 15
 Slides from 1996 (uses Java)
 Basic operations
 Applications: Balanced symbol checker, maze traversal
 Array and linked list implementations
 September 21 and 23: Linked Lists and the STL
 Skim Chapter 16 for basic ideas
 Slides from 1996 (uses Java)
 Linked list basics
 Iterators
 The Standard Template Library
 September 30: No class
 October 5: Binary Search Trees
 Section 17.3, and Section 18.1
 Recursive tree routines.
 Slides from 1996 (uses Java).
for binary search trees.
 Basic algorithms, including deletions and printing tree in sorted order.
 October 7: Binary Search Tree (continued)
 Binary search tree deletion
 Implementations
 October 12: Midterm
 October 14: The STL: sets and maps
 Read remainder of STL handout
 set and map in the STL
 October 21: Discussion of Assignment #4
 October 26: AVL Trees
 October 28, November 2: Quicksort
 Lower bound for sorting
 Quicksort, with coding details
 Quiz (November 2)
 Discussion of Assignment #5
 November 4 and 9: Priority Queues
 Quickly finish up quicksort
 The binary heap
 Heapsort
 Read Chapter 20, through end of Section 20.5.
 November 11: Veteran's Day
 November 16: Application of Priority Queues
 Quiz
 Discussion of Assignment #6.
 November 18: Shortest Path Algorithms
 Read Sections 14.1  14.3
 November 23 and 25: Hash Tables
 November 30: Review
 Evaluations on November 30, at the end of class.
 December 2: Prefinal

Final Examination: Wednesday December 9
 DAY CLASS: 9:30  12:15
 NIGHT CLASS: 15:30  18:15