SUNY Geneseo Department of Computer Science

Exercises and Such

These are the assignments, exams, and related material for CSci 242 (Analysis of Algorithms). Most items are HTML documents that can be read on-line; a few may be in other formats; these you can download from here, to read separately.

Available Exercises

1. Problem Set 1—Graphs
2. Problem Set 2—Breadth First Search
3. Problem Set 3—Depth First Search
4. Problem Set 4—Divide and Conquer
5. Problem Set 5—Inductive Proofs of Correctness
6. Problem Set 6—The Master Method
7. Problem Set 7—Dynamic Programming 1
8. Problem Set 8—Dynamic Programming 2
9. Problem Set 9—The Floyd-Warshall Algorithm
10. Problem Set 10—Dijkstra’s Algorithm
    • Handout
    • Sample Graphs (Maps)
      • Geneseo Streets
      • Train Routes
11. Problem Set 11—Greedy Algorithms
12. Problem Set 12—Minimum Spanning Trees
13. Problem Set 13—Hash Tables
    • Handout
    • Solution
      • Dictionary class
      • WordList class
14. Problem Set 14—Probability and Expected Value
15. Problem Set the Last—Backtracking