Miscellaneous Documents

• Textbook Corrections (2nd edition)
• Textbook Corrections (1st edition) in PostScript
• Math Facts Handout in PostScript or PDF
• 404 Review Handout in Word
• Fall 2008 Midterm Exam & Solutions in Word
• Fall 2001 Midterm Exam & Solutions in Word
• Fall 2003 Midterm Exam & Solutions in Word
• Fall 2006 Midterm Exam & Solutions in PDF
• Selected Solutions to a Fall, 2001 homework assignment in Microsoft Word
• Minimum Spanning Tree Handout in PDF
• Activity Selection Handout in PDF
• Prof. Daniels' Java Source Code (uncommented) for textbook's Euclid's algorithm Euclid.java and modular exponentiation algorithm ModExp.java
• Practice problems for number-theoretic chapter (Ch 31) as part of Fall 2001 homework assignments (in Microsoft Word) HW5 and HW6
• 91.404 BFS/DFS Graph Algorithms Lecture MS PowerPoint
• 91.404 Dijkstra Single-Source Shortest Path Lecture (courtesy of Prof. Costello) in MS PowerPoint
• Link to slide show for the paper "Where all the REALLY hard problems are"
• Fall 2003 Final Exam in Word
• Extra Credit LEDA software experiments: LEDA makefile and hints on how to get started and LEDA documentation.
• David Johnson's Experimental Algorithms Guide in PDF
• Richard Karp's 1972 NP-completeness paper, including a hierarchy of problem reductions (courtesy of Nate) in PDF. Paper bibliographic entry: Richard M. Karp (1972). "Reducibility Among Combinatorial Problems", in R. E. Miller and J. W. Thatcher (editors): Complexity of Computer Computations. New York: Plenum, p. 85-103.