CSCI 1321 (Principles of Algorithm Design II):
Lecture Summaries

• August 30: About the course.
• September 4: Helpful hints from chapter 1; command-line arguments.
• September 6: Recursion (review).
• September 11: No class.
• September 13: Abstract data types; using C++ template classes; recursively-defined lists.
• September 18: Defining C++ template classes.
• September 20: Function parameters.
• September 25: The STL (Standard Template Library), introduction.
• September 27: STL iterators and generic algorithms.
• October 2: Hints about Homework 3; STL iterators and generic algorithms, continued.
• October 4: STL generic algorithms, continued.
• October 9: Review for Exam 1.
• October 11: Exam 1.
• October 16: Defining classes.
• October 18: Defining classes, continued; dynamically-allocated memory.
• October 23: No class.
• October 25: Dynamically-allocated memory, continued; defining classes using dynamically-allocated memory.
• October 30: Defining classes using dynamically-allocated memory, continued; running-time analysis.
• November 1: Implementing linked lists.
• November 6: Homework 5.
• November 8: Implementing linked lists, continued.
• November 13: Double-ended queues ("deques"); returning references from C++ functions.
• November 15: Defining iterators for a class; review of linear data structures.
• November 20: Exam 2.
• November 27: Trees, introduction.
• November 29: Trees, continued; review of Exam 2 problems.
• December 4: Trees, continued.
• December 6: A quick look at order of magnitude of functions; a little about hash tables.
• December 11: Course wrap-up; evaluations.