WARNING:
Changes to this schedule may be made during the course of the semester.
Lecture: Introduction to Algorithms
Lecture: Stable Matchings
Lecture: Sorting
Lecture: Run Time Analysis: Growth of Functions
Lecture: Divide and Conquer
Lecture: Dynamic Programming
- Chapter 6 of Jon Kleinberg's and Éva Tardos' Algorithm Design textbook.
Available at Prof. Kevin Wayne's Algorithms Course Webpage at Princeton University.
- Other resources from this and my previous offerings of this course:
(Note:
Some of the links below are restricted to the WPI domain. So you need to be
on the WPI network to be able to access them.)
- D term 2009
- D term 2008
- B term 2005
Lecture: Graph Algorithms
- Slides Chapter 3 of Jon Kleinberg's and Éva Tardos'
Algorithm Design textbook.
Available at Prof. Kevin Wayne's Algorithms Course Webpage at Princeton University.
- Shortest paths in a graph:
- Other resources from this and my previous offerings of this course:
(Note:
Some of the links below are restricted to the WPI domain. So you need to be
on the WPI network to be able to access them.)
- D term 2009
- D term 2008
- B term 2005
Lecture: Greedy Algorithms
- Slides Chapter 4 of Jon Kleinberg's and Éva Tardos'
Algorithm Design textbook.
Available at Prof. Kevin Wayne's Algorithms Course Webpage at Princeton University.
- More on Dijkstra's algorithm
- Huffman Codes
- Other resources from this and my previous offerings of this course:
(Note:
Some of the links below are restricted to the WPI domain. So you need to be
on the WPI network to be able to access them.)
- D term 2009
- D term 2008
- B term 2005