The ACM-Problem Talks

Data Structures & Algorithms
CS 305 & 503, Fall 2009

10% of your final grade comes from talks about problems you solved. A talk should be around twenty minutes long and will be given in class. A talk should cover:

  1. The problem you solved (four minutes).

  2. The two solutions you developed for your problem (eight minutes). You should solve your problem twice, using two different algorithmic techniques (exhaustive search and greed, for example) or data structures.

  3. An analysis determining which solution was better for some definition of “better”, which you should describe (eight minutes).
The time estimates in parentheses are planning guidelines; feel free to shuffle the minutes, and the talk parts, around as you see fit. The checklist used to evaluate the talks might also be helpful to use while planning your talk.

The available problems are given on the problem list. Talks will be given in class with one talk per class. The talk-time choice is first come, first serve.

Each person will give two talks: one in October and the other in November or December. Once you've picked a problem and a talk time, mail me (rclayton@monmouth.edu) your choices so I can keep the talk schedule up to date. Remember that problem and time choices are first come, first serve, so choose early or prepare for disappointment.

You can change your problem or your talk time (or both) up until two weeks before the talk date. Changes to the problem or date won't be allowed during the two weeks before the date.

For example: If you've chosen Thursday, 22 October for the date, you can change either the date or the problem before Thursday, 8 October. Once it's Thursday, 8 October, you are committed to your chosen problem and date and may not change them.

This page last modified on 8 September 2009.