Algorithm Design

Graph algorithms, greedy algorithms, divide and conquer, dynamic programming and network flow algorithms

The final grade of the course consists of the following components:

• Written exam part 1 (of 1.5h) in week 5 (W1)

• Written exam part 2 (of 1.5h) in week 10/11 (W2)

• Computer exam (3h) in week 10/11 (P)

Final grade

The final grade for the course is computed as follows:

• W = 0.4 W1 + 0.6 W2

• If P < 5 or W < 5, the final grade is min(P,W).

• Else the final grade is 0.5 W + 0.5 P

Both parts P and W can be retaken, in individual exam moments in the resit week.

Written exam (W)

Half-way and at the end of the quarter written examinations of 1.5 hours each are organized. The written exam primarily assesses proving skills and (application of) algorithms and algorithmic theory. Resitting W implies redoing both parts in a single three-hour exam.

Computer exam (P)

Algorithm design and implementation skills are assessed through a computer exam of three hours at the end of the course. The computer exam needs to be submitted through Weblab, but IntelliJ is available within the exam environment.

These partial results are valid only in the current academic year.

Disclaimer: information may change depending on unforeseen circumstances or measures (see: TER Art 29, sub 4).