Home | | Syllabus | | Assignments | | Lecture Notes
Week 1: Big Ideas. Review of Classes and Objects
Lecture 1: Wednesday, 1/22, Course overview and main ideas.
Lecture 2: Friday, 1/24, Review of Classes and Objects.
Style Guide: Guide to comments, indentation, etc. for programs.
Week 2: Programming Principles, Life, Stacks
Lecture 3: Monday, 1/27, Programming Principles, Life
Lecture 4: Wednesday, 1/29, Implementing Life
Lecture 5: Friday, 1/31, Stacks I.
Week 3: Stack Applications, Queues
Lecture 6: Monday, 2/3, Stack Applications
Lecture 7: Wednesday, 2/5, Queues
Lecture 8: Friday, 2/7, Implementing Queues, Class Inheritance.
Week 4: Queue Applications, Linked Stacks
Lecture 9: Monday, 2/10, Queue Applications
Lecture 10: Wednesday, 2/12, Dynamic Memory
Lecture 11: Friday, 2/14, Stacks as linked lists
Week 5: Linked Stacks and Queues, Exam Review
Lecture 12: Monday, 2/17, Copy constructor, assignment overload
Lecture 13: Wednesday, 2/19, Linked Queues, Polynomial calculator
Lecture 14: Friday, 2/21, Review for exam
List of review topics for exam 1
Week 6: Recursion
Lecture 15: Monday, 2/24, Recursion
Lecture 16: Wednesday, 2/26, Tail Recursion
Lecture 17: Friday, 2/28, Backtracking
Week 7: Look Ahead, Lists
Lecture 18: Monday, 3/10, Look ahead
Lecture 19: Wednesday, 3/12, Lists
Lecture 20: Friday, 3/14, Linked Lists
Week 8: Doubly Linked Lists, Search Analysis
Lecture 21: Monday, 3/17, Doubly Linked Lists
Lecture 22: Wednesday, 3/19, Searching Lists
Lecture 23: Friday, 3/21, Analyzing search
Week 9: Search, Asymptotic Analysis
Lecture 24: Monday, 3/24, Analyzing Search II
Lecture 25: Wednesday, 3/26, Asymptotic analysis
Lecture 26: Friday, 3/28, Asymptotic analysis II
Week 10: Sorting, Review
Lecture 27: Monday, 3/31, Insertion Sort
Lecture 28: Wednesday, 4/2, Selection Sort
Lecture 29: Friday, 4/4, Review for Exam 2
Week 11: Merge Sort, Quick Sort
Lecture 30: Monday, 4/7, Analyzing Sorts, Merge Sort
Lecture 31: Wednesday, 4/9, Merge Sort, Quick Sort
Lecture 32: Friday, 4/11, Tables
Week 12: Hash Tables
Lecture 33: Monday, 4/14, Hash Tables
Lecture 34: Wednesday, 4/16, Analyzing Hash Tables
Friday, 4/18, No Class--Easter Break
Week 13: Binary Trees
Monday, 4/21, No Class--Easter Break
Lecture 35: Wednesday, 4/23, Binary Trees
Lecture 36: Friday, 4/25, Binary Search Trees
Week 14: Binary Trees
Lecture 37: Monday, 4/28, Binary Search Trees II
Lecture 38: Wednesday, 4/30, Graphs
Lecture 39: Friday, 5/2, Graphs II
Week 15: Review
Lecture 40: Monday, 5/5, Review for Final Exam
Home | | Syllabus | | Assignments | | Lecture Notes
Constance Royden--croyden@mathcs.holycross.edu
Computer Science 132--Data Structures
Last Modified: January 20, 2014
Page Expires: January 14, 2015