Algorithm EngineeringModule description #40320 / Version 6
- 9 CP
- Portfolio examination
- Graded
- Winter semester
- English, German
This module description is not valid in the current semester (Winter semester 2026/27).
Current version (v13)
| Module / Version | #40320 / #6 |
|---|---|
| Validity | SS 2016 – WS 2016/17 |
| Available language(s) | English, German |
| Credit points | 9 |
| Person responsible for the module | Niedermeier, Rolf |
| Grading | Graded |
| Exam format | Portfolio examination |
| Language(s) of instruction | English, German |
Affiliation
| Faculty | Fakultät IV |
|---|---|
| Institute | Institut für Softwaretechnik und Theoretische Informatik |
| Academic chair | 34351100 FG Algorithmik und Komplexitätstheorie (AKT) |
Contact
| Office | EN 23 |
|---|---|
| Contact person | Thielcke, Christlinde |
| E-mail address | lehre@akt.tu-berlin.de |
| Website | https://www.tu.berlin/akt/studium-lehre/lehrveranstaltungen |
Learning outcomes
On successful completion, students will be able to
- develop and implement efficient algorithms,
- estimate the running time and space consumption of algorithms,
- use standard algorithm libraries and adequate data structures to engineer their algorithms,
- work in teams, and
- give a short oral presentation of the main features of their implementation.
- develop and implement efficient algorithms,
- estimate the running time and space consumption of algorithms,
- use standard algorithm libraries and adequate data structures to engineer their algorithms,
- work in teams, and
- give a short oral presentation of the main features of their implementation.
Content
Learning Content:
The course
- gives an introduction to the basic techniques of Algorithm Engineering, with a particular focus on NP-hard problems,
- helps to design, analyze, and implement algorithms, and
- provides insight into problem modeling and solution strategies including search tree algorithms, data reduction techniques, preprocessing, approximation, heuristics, and approaches based on linear programming (using established solvers).
The course
- gives an introduction to the basic techniques of Algorithm Engineering, with a particular focus on NP-hard problems,
- helps to design, analyze, and implement algorithms, and
- provides insight into problem modeling and solution strategies including search tree algorithms, data reduction techniques, preprocessing, approximation, heuristics, and approaches based on linear programming (using established solvers).
Module components
Compulsory area
The following courses are mandatory for this module:
| Courses | Type | Number | Frequency | Language | Hours per week | Course catalog |
|---|---|---|---|---|---|---|
| Algorithm Engineering | Project | 0434 L 215 / 1 | Winter semester | – | 6 | ISIS |
Workload and credit points
Algorithm Engineering (Project)
| Workload description | Multiplier | Hours | Total |
|---|---|---|---|
| Präsenzzeit | 15 | 6 h | 90 h |
| Vor-/Nachbereitung | 15 | 12 h | 180 h |
| 270 h | |||
The workload of the module adds up to 270 hours. The module therefore comprises 9 credit points.
Description of teaching and learning methods
Regelmäßiger Wechsel von Wissens- und Methodenvermittlung in der Vorlesung und Projektarbeit in Kleingruppen.
Diese umfasst regelmäßige Projektbesprechung, Präsentation von Milestones und Wettbewerbe um schnellsten Lösungscode.
Regular switch between the lecture and project work in small groups. The students apply the methods and knowledge taught in the lecture in the project work.
This includes project meetings on regular basis, presentation of mile stones, and competitions for the fastest implementation.
Diese umfasst regelmäßige Projektbesprechung, Präsentation von Milestones und Wettbewerbe um schnellsten Lösungscode.
Regular switch between the lecture and project work in small groups. The students apply the methods and knowledge taught in the lecture in the project work.
This includes project meetings on regular basis, presentation of mile stones, and competitions for the fastest implementation.
Requirements for participation and examination
Desirable prerequisites for participation in the courses:
Kenntnis der Module "Einführung in die Programmierung", "Algorithmen und Datenstrukturen", "Softwaretechnik und Programmierparadigmen" und "Grundlagen der Algorithmik".
Knowledge of the modules "Introduction into Programming", "Algorithms and Data Structures", "Software Engineering", and "Foundations of Algorithmics".
Knowledge of the modules "Introduction into Programming", "Algorithms and Data Structures", "Software Engineering", and "Foundations of Algorithmics".
Mandatory requirements for the module examination registration:
This module has no examination requirements.
Completion of the module
| Grading | Graded |
|---|---|
| Exam format | Portfolio examination |
| Language | English, German |
Test elements
| Name | Points/Weight | Category | Duration/Extent |
|---|---|---|---|
| (Ergebnisprüfung) 4 Milestone-Präsentationen à 25 Punkte | 100 |
Exam description
Die Gesamtnote gemäß §47 (2) AllgStuPO wird nach dem Notenschlüssel 1 der Fakultät IV ermittelt.
Vier Milestone-Präsentationen: Geprüft wird die Qualität der Präsentation der angefertigten Implementierung für den jeweiligen Themenkomplex. Hierzu erläutern die Studierenden die wesentlichen Designentscheidungen in ihren Algorithmen. Die Studierenden belegen und verteidigen ihre Entscheidungen durch experimentelle Testreihen auf vorgegebenen Datensätzen.
In accordance with § 47 (2) AllgStuPO, the final grade will be determined by applying the grading key 1 of faculty IV.
Four miles tone presentations: The quality of the presentation of the implementation made for the respective range of topics. Herein, the students explain the significant implementation decisions of their algorithms. The students justify their decisions with experimental evaluations on given test sets.
Vier Milestone-Präsentationen: Geprüft wird die Qualität der Präsentation der angefertigten Implementierung für den jeweiligen Themenkomplex. Hierzu erläutern die Studierenden die wesentlichen Designentscheidungen in ihren Algorithmen. Die Studierenden belegen und verteidigen ihre Entscheidungen durch experimentelle Testreihen auf vorgegebenen Datensätzen.
In accordance with § 47 (2) AllgStuPO, the final grade will be determined by applying the grading key 1 of faculty IV.
Four miles tone presentations: The quality of the presentation of the implementation made for the respective range of topics. Herein, the students explain the significant implementation decisions of their algorithms. The students justify their decisions with experimental evaluations on given test sets.
Duration of the module
The following number of semesters is estimated for taking and completing the module: 1 semester(s).
This module can be started in the following semesters: Winter semester.
Maximum number of participants
The maximum capacity of participants is 15.
Registration procedures
Die Anmeldung erfolgt über QISPOS (für BSc Informatik) bzw. direkt beim Prüfungsamt.
Please register at QISPOS or directly at the examination office.
Please register at QISPOS or directly at the examination office.
Recommended reading, lecture notes
Lecture notes
unavailable
Electronic lecture notes
available – Hinweis: Vorlesungsfolien sind unter www.isis.tu-berlin.de verfügbar.
Recommended literature
No recommended literature given
Assigned programs
This module is not used in any program.
Bei ausreichenden Kapazitäten auch als Wahlpflichtmodul in anderen Studiengängen wählbar.
Miscellaneous
Not specified