CS 441/539 Course Handouts

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

Sample Write-up for Dynamic Programming (in postscript)/ (in pdf)

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

Practice Problems on Approximation Algorithms (in postscript)/ (in pdf)

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

More Practice Problems on NP-completeness (in postscript)/ (in pdf)

Competitive Online Algorithms Mini-Course Notes (by Susanna Albers) (in compressed postscript)/ (an html version with very similar content)

Practice Problems on Lower Bound Proofs (in postscript)/ (in pdf)