Literature
We will mainly be using Algorithms 4/E. by Robert Sedgewick & Kevin Wayne: Algorithms 4/E. Author site. Addison Wesley, 2011, Edition 4. (ISBN 9780321573513) Book site. (You need a copy of this book.)
Course info
-
Module: Algorithms and Data structures (ALDA)
-
Semester: 3
-
Credits: 5
-
Teachers: Richard van den Ham (HVD) & Pieter van den Hombergh (HOM),
Additional resources
-
A nice book with all kind of practical examples:
Taschenbuch der Algorithmen
or: Algorithms Unplugged -
The famous video lectures from: MIT.
Alda Run
The test results of the students assigment, including test and optional coverage reports as well as the teachers tests can be found per topic in the following places:
Alda Run Rules
All testing as described below is on best effort basis. Things may break when running alien (that is: your) code.
The student repositories are regularly checked for a new code revision.
-
The student code (and test-code) is compiled. On any compiler error, the compiler output is published then STOP.
-
The student tests are run on the students code. If there are errors, the error report is published then STOP.
-
A coverage test run is performed with the code and test code above. The resulting coverage report is published.
-
If all tests are green in the above and the code coverage lies above the threshold, the teachers tests are run.
-
The teacher’s tests are combined with the student’s code and compiled. On any compiler error, the the compiler output is published then STOP.
-
The teacher’s tests are run on the students code. If there are any errors, the error report is published then STOP.
-
If there are no errors in the previous step, a coverage test run is done and a coverage report is published.
-
The goal of the exercise is to pass the teacher’s tests with no errors. The winner is that student that meets the goal in the earliest date-time. The date-time used is the svn commit time.