Groups of two to three are to pick a topic. A topic should be a kind of
algorithmic or programming problem that several contest-like problems
have in common. Some topics are listed below. These aren't exhaustive,
aren't disjoint, can be subdivided into interesting subsets and aren't
meant to be prescriptive.
Greedy Algorithms
Dynamic Programming
Computational Geometry
Backtracking/Game Playing
Brute Force
Graph Algorithms
topological sort
depth/breadth-first search
connected components
matching
shortest-path
NP-complete problems/approximations
String matching
Simulation
STL stuff
C++ (or C or Java) idiosyncrasies
Presentation
A presentation should last no more than half-an hour.
You should provide the following as part of your presentation.
Web pages or PDF documentation of everything you do. These should
be submitted as a zip/tar archive using
submit_cps149s project foo.tar
If you submit web pages, the archive should have all the pages so that
unzipping/untarring and pointing a browser at the top-level index.html
file will find all you've done.
A list of three to five problems in the genre and copies/links to these
problems.
Solutions to at least two problems that illustrate the genre and
how to solve the problems in a contest, i.e., quick, dirty, elegant.
A description of the key issues and approaches in dealing with
problems in the genre. These should be sufficient or provide pointers to
sufficient information for someone to sovle the problems.