Home | | Syllabus | | Assignments | | Lecture Notes
Week 1: Big Ideas. Review of Classes and Objects
Lecture 1: Wednesday, 1/14, Course overview and main ideas.
Lecture 2: Friday, 1/16, Classes and Objects.
Style Guide: Guide to comments, indentation, etc. for programs.
Week 2: Programming style. Life.
Lecture 3: Wednesday, 1/21, Programming Style; Life.
Lecture 4: Friday, 1/23, Life.
Week 3: Stacks
Lecture 5: Monday, 1/26, Stacks.
Lecture 6: Wednesday, 1/28, Stack Applications.
Lecture 7: Friday, 1/30, Queues.
Week 4: Queues
Lecture 8: Monday, 2/2, Implementing Queues; Class inheritance.
Lecture 9: Wednesday, 2/4, Queue applications.
Lecture 10: Friday, 2/6, Dynamic Memory.
Week 5: Stacks and Queues as Linked Lists
Lecture 11: Monday, 2/9, Implementing stacks as linked lists.
Lecture 12: Wednesday, 2/11, Destructors, Copy Constructors and assignment overload.
Lecture 13: Friday, 2/13, Exam review.
Week 6: Queues as Linked Lists. Recursion
Lecture 14: Monday, 2/16, Queues as linked lists.
Lecture 15: Wednesday, 2/18, Recursion.
Lecture 16: Friday, 2/20, Recursion II.
Week 7: Backtracking, Look-ahead. Lists
Lecture 17: Monday, 2/23, Backtracking.
Lecture 18: Wednesday, 2/25, LookAhead.
Lecture 19: Friday, 2/27, Lists.
Week 8: Linked Lists, Search
Lecture 20: Monday, 3/9, Linked Lists.
Lecture 21: Wednesday, 3/11, Doubly Linked Lists.
Lecture 22: Friday, 3/13, Search I.
Week 9: Linked Lists, Search
Lecture 23: Monday, 3/16, Search II.
Lecture 24: Wednesday, 3/18, Analyzing search.
Friday, 3/20: Lecture canceled.
Week 10: Asymptotic analysis, Exam Review
Lecture 25: Monday, 3/23, Asymptotic Analysis.
Lecture 26: Wednesday, 3/25, Asymptotic Analysis II.
Lecture 27: Friday, 3/27, Review Topics for Exam 1.
Solutions to review problems.
Week 11: Sorting
Lecture 28: Monday, 3/30, Insertion Sort.
Lecture 29: Wednesday, 4/1, Selection Sort.
Lecture 30: Friday, 4/3, Sort Analysis, Merge Sort.
Week 12: Merge Sort and Quick Sort, Tables
Lecture 31: Monday, 4/6, Merge Sort II, Quick Sort.
Lecture 32: Wednesday, 4/8, Quick Sort II, Tables.
Week 13: Tables
Lecture 33: Wednesday, 4/15, Table ADT, Hash Tables.
Lecture 34: Friday, 4/17, Analyzing Hash Tables.
Week 14: Binary Trees
Lecture 35: Monday, 4/20, Binary Trees.
Lecture 36: Wednesday, 4/22, Binary Search Trees.
Lecture 37: Friday, 4/24, Binary Search Trees II.
Week 15: Review for final
Lecture 38: Monday, 4/27, Review for Final.
Solutions to review problems.
Home | | Syllabus | | Assignments | | Lecture Notes
Constance Royden--croyden@mathcs.holycross.edu
Computer Science 132--Data Structures
Date Created: January 14, 2002
Last Modified: January 2, 2009
Page Expires: January 14, 2010