The ACM-Problem Talks

CS 306, Fall 2007


10% of your final grade comes from a talk about a problem you solved. The talk should be around a half-hour long and will be given in class. The talk should cover:

  1. The problem you solved (five minutes).

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

  3. An analysis determining which solution was better for some definition of “better”, which you should describe (ten minutes).
The time estimates in parentheses are guidelines for planning a half-hour talk. Feel free to shuffle the minutes around as you see fit.

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.

Available dates are:

November:

13 Tuesday
15 Thursday
20 Tuesday
22 Thursday
27 Tuesday
29 Thursday
December:

4 Tuesday
6 Thursday
11 Tuesday

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 disapointment.

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 Tuesday, 23 October for the date, you can change either the date or the problem before Tuesday, 9 October. Once it's Tuesday, 9 October, you are committed to your chosen problem and date and may not change them.


This page last modified on 31 October 2007.