Algorithm EngineeringModule description #40320 / Version 9
- 9 CP
- Portfolio examination
- Graded
- Winter and summer semester
- German
This module description is not valid in the current semester (Winter semester 2026/27).
Current version (v13)
| Module / Version | #40320 / #9 |
|---|---|
| Validity | Summer semester 2022 – Winter semester 2022/23 |
| Available language(s) | German |
| Credit points | 9 |
| Person responsible for the module | Nichterlein, André |
| Grading | Graded |
| Exam format | Portfolio examination |
| Language(s) of instruction | 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 and summer semester | [en, de] | 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
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.
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:
Knowledge of the modules "Introduction into Programming", "Algorithms and Data Structures", "Software Engineering", and "Algorithms Theory".
Mandatory requirements for the module examination registration:
This module has no examination requirements.
Completion of the module
| Grading | Graded |
|---|---|
| Exam format | Portfolio examination |
| Type of portfolio examination | 100 points in total |
| Language | English, German |
Test elements
| Name | Points/Weight | Category | Duration/Extent |
|---|---|---|---|
| 1. Milestone | 25 | flexibel | Siehe Prüfungsbeschreibung |
| 2. Milestone | 25 | flexibel | Siehe Prüfungsbeschreibung |
| 3. Milestone | 25 | flexibel | Siehe Prüfungsbeschreibung |
| 4. Milestone | 25 | flexibel | Siehe Prüfungsbeschreibung |
Exam description
Four milestones:
For each topic the students will develop an implementation solving specified computational tasks.
The performance of the implementation and the quality of the presentation are evaluated. In the presentations, the students explain the essential implementation decisions of their algorithms. The students justify their decisions with experimental evaluations on given test data sets.
For each topic the students will develop an implementation solving specified computational tasks.
The performance of the implementation and the quality of the presentation are evaluated. In the presentations, the students explain the essential implementation decisions of their algorithms. The students justify their decisions with experimental evaluations on given test data 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 and summer 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 – Slides will be made available during the lecture period: www.isis.tu-berlin.de
Recommended literature
No recommended literature given
Assigned programs
This module version is used in the following programs:
| Program / program version | Semester(s) | Curriculum component |
|---|---|---|
| Industrial Engineering and Management Industrial Engineering and Management (M. Sc.) - StuPO 2015 | SS 2022 | Ingenieurwissenschaftliche Studienrichtungen/Engineering Majors › Informations- und Kommunikationssysteme/Information and Communication Systems (IKS) › Informations- und Kommunikationssysteme/Information and Communication Systems (Wahlpflicht/Compulsory-Elective) › Data and Software Engineering |
| WS 2022/23 | Ingenieurwissenschaftliche Studienrichtungen/Engineering Majors › Informations- und Kommunikationssysteme/Information and Communication Systems (IKS) › Informations- und Kommunikationssysteme/Information and Communication Systems (Wahlpflicht/Compulsory-Elective) › Data and Software Engineering |
Bei ausreichenden Kapazitäten auch als Wahlpflichtmodul in anderen Studiengängen wählbar.
Miscellaneous
Dieses Modul wird nicht regelmäßig angeboten, bitte informieren Sie sich über unsere Website: http://www.akt.tu-berlin.de/menue/teaching/
This course is not offered regularly, you will find detailed information on our website: http://www.akt.tu-berlin.de/menue/teaching/
This course is not offered regularly, you will find detailed information on our website: http://www.akt.tu-berlin.de/menue/teaching/