ISE 390 -- Programming Assignments

There will be 13 problem sets over the course of the semester, each given out on a Thursday and due the following Tuesday. This deadline may be extended to Thursday if there is a class consensus. Each problem set will consist of about 5 to 6 programming problems. The goal is to maximize the number of problems solved correctly each week -- there is no partial credit.

Note that the postscript version of each problem is more likely to be accurate than the HTML version, so check the postscript if you are at all confused.

Arrays and Iteration

Cards and Games

Strings: Library Routines and Representations

Sorting: Library Routines and Variants

Math: Arithmetic and Algebra

Number Theory: Primes, Divisibility, and Arithmetic

Backtracking: Permutations and Subsets

Graphs: Traversal

Graphs: Paths and Topological Sorting

Dynamic Programming: Edit Distance and Making Change

Geometry: Grids

Geometry: Hulls, Areas and Intersections

Parsing: Recursive Descent