


The problems for Phase 2 (onsite contest) will tentatively follow the following
guidelines (not necessarily in the given order):
Problem 1  Simple program. Use of branching but not loops or arrays. 
Problem 2  Basic loops or arrays. 
Problem 3, 4  Combinations of loops, interesting algorithms, nontrivial loops. 
Problem 5:  More advanced algorithms; e.g., graphs, recursion, dynamic programming. 
