TCS / Studies / T-79.5202 / Exercises and home assignments

## T-79.5202 Combinatorial algorithms / Exercises 2007

### Exercises

A collection of exercises and their solutions [pdf, in Finnish] is available. An [English version] will be made available as the course proceeds. The problems are approximately graded for difficulty as follows:

* -- An easy problem; can be solved directly from the definitions or directly applying the algorithms discussed.
** -- Moderately difficult; requires some insight or is slightly more laborious
*** -- Somewhat challenging; requires applying the knowledge gained in the course or is somewhat laborious

In exercise sessions assistant shows solutions to 3-4 demo exercises from the topic of the lecture one week before.

• Exercise session 1 (Jan 23): exercises 3, 4, 5, 8.
• Exercise session 2 (Jan 30): exercises 18 (not e), 21, 22, 23 as in English version.
• (Correct names of two things which came up were: polya enumeration theorem and Fano plane)
• Exercise session 3 (Feb 6): exercises 9, 11, 12, 13
• Exercise session 4 (Feb 13): exercise 21
• Exercise session 5 (Feb 20): exercises 27 a), 30 a), b), c), 31 ( considering 30 a), b), c) ),
• Exercise session 6 (Feb 27): 27 b), rest of 30 and 31. Few real-life examples of the Stochastic etc. searches.
• No exercise session on Mar 6
• Exercise session 7 (Mar 13): exercises 28, 29, 32 a), b)
• Exercise session 8 (Mar 20): exercises 14, 16, 17
• Exercise session 9 (Mar 27): exercises 33, 34
• Exercise session 10 (Apr 3): exercises 37, 40, 45
• No exercise session on Apr 10
• Exercise session 11 (Apr 17): exercises 35, 36, 39
• Exercise session 12 (Apr 24): exercises 42, 43, 44

### Home assignments

Home assignments and peer reviewing them are an obligatory part of the course. The three home assignments will be published on this page.

The home assignments (and peer reviewing them) must be passed before taking the exam. The weight of the home assignments on the course is considerable: the maximum score on the exam is 24, and each home assignment is graded on a 0-6 scale. We guarantee that with 50% of all points a student will pass the course. Other than this the grading scale is decided afterwards.

If a submission is clearly deficient, the student will be asked to revise it. Also a good report can be returned to the student for revision, if the report contains a significant error.

Approximate guidelines: less than 3 points = unacceptable; significant shortcomings in the solution or badly reported; will be returned to the student to be completed. 3 points = least acceptable performance. Minimum requirements satisfied and adequately reported. 6 points = a truly extraordinary performance. Presents something special regarding the problem considered and is very well reported. If a report is returned to the student for revision, 1 point is subtracted from the score. Each time a student submits a report, a revised report, or a peer review after the deadline similarly costs one point, and one extra point for every three days late.

Familiarize yourself with the instructions for submitting the home assignments. There are also LaTeX templates for the is also a report [pdf] and code [pdf] parts of the submission.

### Peer review

The students will review the submissions of two other students using the given form. The form is emailed to the assistant, who will then forward the evaluations to the authors of the report. In this way everyone receives two peer reviews for each report.

The reports will be made available to other participants of the course. We will carry out a single-blind review: the reviewers will know whose report they are reviewing, but the author will not know who has reviewed their report.
Päivitetty viimeksi 14.04.2007. (hahatcs.hut.fi)