CS 441/539 Course Handouts
o Course Introduction (in postscript)/ (in pdf)

o Proving Correctness for Greedy Algorithms (in postscript)/ (in pdf)

o Practice Problems on Greedy Algorithms (in postscript)/ (in pdf)

o Practice Problems on Dynamic Programming (in postscript)/ (in pdf)

o Practice Problems on NP-Completeness (in postscript)/ (in pdf)

o Adversary Lower Bound Technique (in postscript)/ (in pdf)

o Practice Problem solution for HW 5.

o More Practice Problems (in postscript)/ (in pdf)

o Homeworks

Return to the CS441/539 Home Page