SUNY Geneseo Department of Computer Science

Exercises and Such

These are the assignments, exams, and related material for CSci 240 (Foundations 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. Lab 1 -- Java Review
   • Handout
2. Problem Set 1 -- Pre- and Postconditions
   • Handout
3. Problem Set 2 -- Proof
   • Handout
4. Lab 2 -- Introduction to Experimentation
   • Handout
5. Problem Set 3 -- Logic
   • Handout
6. Lab 3 -- Recursion
   • Handout
   • Solution
     • Main class with zero-finder and palindrome generator (RecursionDemo.java)
     • Canvas subclass for drawing maps (IslandCanvas.java)
     • Mathematical function interface (Function.java)
     • Quadratic function class (Quadratic.java)
     • Sine function class (SineFunction.java)
7. Problem Set 4 -- Induction
   • Handout
8. Problem Set 5 -- Induction and Algorithms
   • Handout
9. Lab 4 -- Debugging
   • Handout
10. Problem Set 6 -- More Induction and Algorithms
    • Handout
11. Problem Set 7 -- Recurrence Relations
    • Handout
12. Lab 5 -- Asymptotic Execution Times
    • Handout
13. Problem Set 8 -- The Master Theorem
    • Handout
    • Solution
14. Lab 6 -- Loop Invariants
    • Handout
    • Solution
15. Problem Set 9 -- Proofs about Loops
    • Handout
16. Lab 7 -- Θ(n²) Sorting Algorithms
    • Handout
17. Lab 8 -- Quicksort
    • Handout
18. Problem Set 10 -- Analysis of Loops
    • Handout
19. Lab 9 -- Θ(nlogn) Sorting Algorithms
    • Handout
20. Problem Set 11 -- Algorithm Analysis with the Master Theorem
    • Handout
21. Lab 10 -- Testing
    • Handout
22. Problem Set 12 -- Trees
    • Handout
23. Lab 11 -- Tree Height
    • Handout
24. Lab 12 -- A "Dictionary" Data Structure
    • Handout
25. Problem Set 13 -- Heaps
    • Handout
26. Problem Set 14 -- Trees in Arrays
    • Handout
27. Lab 13 -- Heapsort
    • Handout