- Jan 15 - Introduction
- Jan 22 - Basic data structures (stack, queue, search tree, heap, hash table)
- Jan 29 - Advanced data structures (segment tree, disjoint set union (or union-find))
- Feb 5 - Advanced data structures (segment tree, disjoint set union (or union-find))
- Feb 12 - Problem solving techniques (full search)
- Feb 19 - Problem solving techniques (divide and conquer & greedy)
- Feb 26 - Problem solving techniques (greedy)
- Mar 5 - Problem solving techniques (dynamic programming)
- Mar 19 - Midterm Competition
- Mar 25 - More dynamic programming
- Apr 2 - And more dynamic programming
- Apr 9 - Graph algorithms
- Apr 16 - Graph algorithms + Game theory
- Apr 23 - Computational Geometry
- Apr 30 - Final Competition

- Homework 1 - text solutions with proof of correctness and time and space analysis due Feb 26. Code due Mar 24.

To submit the code, please open Homework 1 contest webpage. To login you can use your first name as username and last name as password. 10 problems that you can see are essentially just different test cases for the single homework problem. To submit, open the submissions link and submit your code for ALL tests cases. - Homework 2. The total maximum score is 13pts. 3rd problem is partially extra problem. If you write just text solution, you will get 2 points. The code will add 3 extra points. Text solutions, which contain proof of correctness and space analysis due Mar 31. Code is due Apr. 6. To submit the code go to http://tritanium.mathcs.emory.edu/pcontests/hw2.
- Homework 3. To submit the code go to http://tritanium.mathcs.emory.edu/pcontests/hw3.
- Homework 4. To submit the code go to http://tritanium.mathcs.emory.edu/pcontests/hw4.

Emory University 2013