CPS 149s,
Fall 1999
grading
Grading Policy
There will be three problems given out each week, except for the weeks of fall break and Thanksgiving. During the weeks of a programming contest (practice and real) those problems will replace the normal problem set. There will be several practice contests given before the regional competition.
Points
In each set, the problems will be (subjectively) categorized by difficulty. The more difficult problems can earn more points. In general, partial credit will be given for solutions that work for all of the sample input and some of the other test cases:
| Solution | Points | ||
|---|---|---|---|
| regular | star | double star | |
| Close (sample and some other) | 2 | 3 | 4 |
| All data sets | 4 | 6 | 8 |
To get credit for a problem, you must turn in a sample data file that includes some "non-trivial" data set, i.e., not just a parrot of the sample input. You must also submit a README file that describes why you think your data set is useful. Points (up to full credit) may be earned by correcting a previous week's submission and submitting a data set that exercises the fix. Up to two extra points can also be earned for data sets that stump other point-earning solutions. There are no penalties for duplicate submissions.
To earn a B, you must average 4 points a week, with at most one week of earning zero points.
Presentation
In addition to submitting solutions to problems, groups of two or three people will need to make a presentation about a problem genre. You'll need to decide on a genre, find problems of the genre, and write up a web-izable description of the problems, the genre, and solution(s) where feasible. Groups that do a presentation early can ask for the problems to be considered as part of a future regular class problem.
Completion of the presentation is required for a grade of B, you can earn a C without a presentation.