Algorithms: Programming Assignment (laborations)

Back to course information page.

The purpose of this assignment is to experience the difference in performance between exponential-time heuristics and a well-designed fast algorithms, and to see in practice how one of the main design principle solves a problem.

The assignment focusses on one problem, solved with three different algorithmic techniques. This means the assignment has three different submissions, but all submissions work on the same problem.

Before introducing the tasks you are supposed to solve, we invite you to read carefully the following policy statements. For any question about them please send an email to {tedesco,azams}@chalmers.se.


Group policy


Contents of a submission

Each submission will contain exactly two files: Details about these two contents are part-specific, and they are specified below.

Where to submit

You will submit on the Fire system. If you are not familiar with the system, please have a look at this guide.

How to submit

When you think your submission is ready to be checked, upload it on Fire following these recommendations:

Deadlines

Part 1: Friday, 9 September, 23:59.
Part 2: Friday, 23 September, 23:59.
Part 3: Friday, 7 October, 23:59.
Final deadline for all corrected solutions: friday, 21 October, 23:59.
The deadlines are really strict: the submission system will close at these times. If you cannot complete your assignment before the final deadline, you will have to wait until the course is given the next time (probably with a changed assignment).

Grading Policy

The following grading policy will be enforced for all submissions. A note in case of a resubmission: please mark the revised text within your file with a different color.

The assignment

If everything is clear you can accept our policy and move to the problem by clicking on this link.

Familiar with the policy and the problem already? Then move on to: