Home | | Syllabus | | Assignments | | Lecture Notes
Week 1: Big Ideas. Review of Classes and Objects
Lecture 1: Wednesday, 1/21, Course overview and main ideas.
Lecture 2: Friday, 1/23, Review classes and objects.
Style Guide: Guide to comments, indentation, etc. for programs.
Week 2: Programming Principles and the Game of Life
Lecture 3: Monday, 1/26, Programming Principles.
Lecture 4: Wednesday, 1/28, Implementing Life.
Lecture 5: Friday, 1/30, Stacks I.
Week 3: Stacks and Queues
Lecture 6: Monday, 2/2, Stack Applications.
Lecture 7: Wednesday, 2/4, Queues.
Lecture 8: Friday, 2/6, Queues and inheritance.
Week 4: Queues and Pointers
Lecture 9: Monday, 2/9, Queue Applications.
Lecture 10: Wednesday, 2/11, Dynamic Memory.
Week 5: Stacks and Queues as Linked Lists
Lecture 11: Monday, 2/16, Stacks as Linked Lists.
Lecture 12: Wednesday, 2/18, Destructors, Copy constructors, and overloading.
Lecture 13: Friday, 2/20, review for exam 1.
Week 6: Queues as Linked Lists, Recursion
Lecture 14: Monday, 2/23, Queues as Linked Lists.
Lecture 15: Wednesday, 2/25, Recursion I.
Lecture 16: Friday, 2/27, Tail Recursion.
Week 7: Recursion, Lists
Lecture 17: Monday, 3/1, Backtracking.
Lecture 18: Wednesday, 3/3, Look Ahead.
Lecture 19: Friday, 3/5, Lists.
Week 8: Lists
Lecture 20: Monday, 3/15, Linked Lists.
Lecture 21: Wednesday, 3/17, Doubly Linked Lists.
Lecture 22: Friday, 3/19, Search I.
Week 9: Search, Asymptotic Notation
Lecture 23: Monday, 3/22, Analyzing Search.
Lecture 24: Wednesday, 3/24, Analyzing Search II.
Lecture 25: Friday, 3/26, Asymptotic Notation.
Week 10: Asymptotic Analysis, Sorting
Lecture 26: Monday, 3/29, Asymptotic analysis II.
Lecture 27: Wednesday, 3/31, Insertion Sort.
Lecture 28: Friday, 4/2, Selection Sort.
Week 11: Exam Review, Sorting
Lecture 29: Monday, 4/5, Review for exam 2.
Lecture 30: Wednesday, 4/7, Sorting Analysis, Merge Sort.
Week 12: Merge Sort and Quick Sort
Lecture 31: Wednesday, 4/14, Analysis of Merge Sort.
Lecture 32: Friday, 4/16, Quick Sort; Tables I.
Week 13: Tables
Lecture 33: Monday, 4/19, Tables II.
Lecture 34: Wednesday, 4/21, Hash Tables.
Lecture 35: Friday, 4/23, Hash Tables and Trees.
Week 14: Binary Trees
Lecture 36: Monday, 4/26, Binary Trees.
Lecture 37: Wednesday, 4/28, Binary Search Trees.
Lecture 38: Friday, 4/30, Binary Search Trees II.
Week 15: Review
Final exam review Thursday, 5/6.
Solutions to Final exam review.
Home | | Syllabus | | Assignments | | Lecture Notes
Constance Royden--croyden@mathcs.holycross.edu
Computer Science 262--Data Structures
Date Created: January 14, 2002
Last Modified: January 8, 2004
Page Expires: January 14, 2005