Course Introduction
(in postscript)/
(in pdf)
Overview of Greedy Choice/Optimal Substructure Methodology
(in postscript)/
(in pdf)
Proving Correctness for Greedy Algorithms
(in postscript)/
(in pdf)
Practice Problems on Greedy Algorithms
(in postscript)/
(in pdf)
Solutions for Rest of Practice Problems on Greedy Algorithms
(in postscript)/
(in pdf)
Practice Problems on Dynamic Programming
(in postscript)/
(in pdf)
Hints for Practice Problems 3 and 4.
Sample Write-up for Dynamic Programming
(in postscript)/
(in pdf)
Practice Problems for HW 3
(in postscript)/
(in pdf)
Adversary Lower Bound Technique
(in postscript)/
(in pdf)
Lower Bound Practice Problems (in postscript)
(in postscript)/
(in pdf)Return to the CS441/539 Home Page