Each participant implements a (simple) algorithm in a programming language of their own choice. Topics will be distributed individually: meet with, or send email to the organizer. The focus of the implementation shall be on code readability and optimal asymptotics, which ideally is verified by systematic testing.
The source code and some test data (where applicable) has to be sent to the organiser one week before the final presentation. During the final presentation, every participant runs and explains her/his software in front of everybody. If the result is not satisfactory, a correction can be provided until the end of the semester.
Algorithmen und Datenstrukturen
Frequency | Weekday | Time | Format / Place | Period |
---|
Module | Course | Requirements | |
---|---|---|---|
39-Inf-AB Algorithmen der Bioinformatik | Algorithmische Implementierung | Study requirement
|
Student information |
39-Inf-SAB_a Spezielle Algorithmen der Bioinformatik | Algorithmische Implementierung | Study requirement
|
Student information |
The binding module descriptions contain further information, including specifications on the "types of assignments" students need to complete. In cases where a module description mentions more than one kind of assignment, the respective member of the teaching staff will decide which task(s) they assign the students.