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

• January 10: About the course.
• January 12: Command-line arguments, review of recursion.
• January 15: Review of recursion, continued.
• January 17: Review of abstract data types, classes.
• January 19: The C++ "string" class, more recursion.
• January 22: Recursive data structures (linked list); using template classes.
• January 24: Recursive data structures and template classes, continued.
• January 26: Recursive data structures and template classes, continued.
• January 29: Template classes and functions.
• January 31: Template classes and functions, function parameters.
• February 2: Programming tools -- editors, compilers, and debuggers.
• February 5: No class.
• February 7: The Standard Template Library -- introduction.
• February 9: The Standard Template Library -- iterators.
• February 12: The Standard Template Library -- iterators and generic algorithms.
• February 14: Discussion of Homework 3.
• February 16: The Standard Template Library -- iterators and generic algorithms, continued.
• February 19: More discussion of Homework 3 and the STL.
• February 21: Exam 1.
• February 23: Defining classes -- member, static member, and friend functions.
• February 26: No class.
• February 28: No class.
• March 2: Defining classes, continued.
• March 5: Dynamic memory allocation.
• March 7: Dynamic memory allocation, continued.
• March 9: Dynamic memory allocation and classes.
• March 12, 14, 16: Spring break.
• March 19: Dynamic memory allocation and classes (review), linked lists.
• March 21: Linked lists, continued.
• March 23: Linked lists, continued.
• March 26: Linked lists, continued.
• March 28: Double-ended queues (deques).
• April 2: Defining iterators for a class.
• April 4: Exam 2.
• April 6: Review of linear data structures; stacks.
• April 9: No class.
• April 11: Trees.
• April 13: Holiday.
• April 16: Trees, continued; binary search trees.
• April 18: Binary search trees, continued; order of magnitude of functions.
• April 20: Discussion of Homework 8.
• April 23: No class.
• April 25: Order of magnitude of functions, continued.
• April 27: Hashing and hash tables, a short introduction.
• April 30: Review for final; evaluations.