Home | | Syllabus | | Assignments | | Lecture Notes
Week 1: Introduction. Asymptotic Analysis.
Lecture 1: Wednesday, 8/29, Course overview and Introduction.
Lecture 2: Friday, 8/31, Introduction to Asymptotic Analysis.
Week 2: Asymptotic Analysis, Functions.
Lecture 3: Monday, 9/3, Asymptotic analysis.
Lecture 4: Wednesday, 9/5, More asymptotic analysis.
Lecture 5: Friday, 9/7, Logs and Exponents.
Week 3: Recurrence Equations.
Lecture 6: Monday, 9/10, Recurrences I.
Lecture 7: Wednesday, 9/12, Recurrences II.
Lecture 8: Friday, 9/14, Recurrences III.
Week 4: Probability.
Lecture 9: Monday, 9/17, Probability I.
Lecture 10: Wednesday, 9/19, Probability II.
Lecture 11: Friday, 9/21, Elementary Sorts I.
Week 5: Sorting
Lecture 12: Monday, 9/24, Elementary Sorts II.
Lecture 13: Wednesday, 9/26, Heap Sort I.
Lecture 14: Friday, 9/28, Heap Sort II.
Week 6: Quick Sort, Linear Sort
Lecture 15: Monday, 10/1, Quick Sort I.
Lecture 16: Wednesday, 10/3, Quick Sort II.
Lecture 17: Friday, 10/5, Linear Sorts.
Week 7: Order Statistics
Lecture 18: Wednesday, 10/10, Order Statistics I.
Lecture 19: Friday, 10/12, Order Statistics II.
Week 8: Midterm Exam, Binary Trees
Lecture 20: Monday, 10/15, Review for Midterm Exam.
Topics for Midterm Exam.
Lecture 21: Wednesday, 10/17, Midterm Exam
Lecture 22: Friday, 10/19, Order Statistics, Binary Trees.
Week 9: Binary Search Trees, Red Black Trees
Lecture 23: Monday, 10/22, Binary Search Trees; Red Black Trees.
Lecture 24: Wednesday, 10/24, Red Black Trees II.
Lecture 25: Friday, 10/26, Red Black Trees III.
Week 10: Dynamic Programming
Lecture 26: Monday, 10/29, Dynamic Programming.
Lecture 27: Wednesday, 10/31, Dynamic Programming II.
Lecture 28: Friday, 11/2, Dynamic Programming III.
Week 11: Greedy Algorithms
Lecture 29: Monday, 11/5, Dynamic Programming, Greedy Algorithms.
Lecture 30: Wednesday, 11/7, More Greedy Algorithms.
Lecture 31: Friday, 11/9, Huffman Codes.
Week 12: Graphs
Lecture 32: Monday, 11/12, Graphs I.
Lecture 33: Wednesday, 11/14, Breadth First Search, Depth First Search.
Lecture 34: Friday, 11/16, Classifying Edges, Time Stamps.
Week 13: Graphs, Thanksgiving break
Lecture 35: Monday, 11/19, Topological Sort, Connected Components.
Wednesday 11/21, Friday 11/23--NO CLASS--HAPPY THANKSGIVING
Week 14: Graphs, Complexity
Lecture 36: Monday, 11/26, Minimum Spanning Trees.
Lecture 37: Wednesday, 11/28, P, NP, Non-computability.
Lecture 38: Friday, 11/30, The Halting Problem.
Week 15: Review
Lecture 39: Monday, 12/3, Review for Final Exam.
Topics for Final Exam.
Home | | Syllabus | | Assignments | | Lecture Notes
Constance Royden--croyden@mathcs.holycross.edu
Computer Science 235--Analysis of Algorithms
Date Created: August 26, 2005
Last Modified: August 24, 2007
Page Expires: August 24, 2008