Algorithm Engineering IIModule description #40320 / Version 13
- 9 CP
- Portfolio examination
- Graded
- Irregular
- English
| Module / Version | #40320 / #13 |
|---|---|
| Validity | Since Summer semester 2026 |
| Available language(s) | English, German |
| Credit points | 9 |
| Person responsible for the module | Nichterlein, André |
| Grading | Graded |
| Exam format | Portfolio examination |
| Language(s) of instruction | English |
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
Successful participation enables students to
- perform multivariate estimation of running time and memory requirements of algorithms,
- assess the advantages and disadvantages of different algorithms for given data sets,
- analyze different algorithmic approaches presented in scientific publications, develop efficient algorithms from them and produce efficient implementations,
- to use modern algorithmic libraries and adequate data structures to gradually improve their implementation,
- exploit modern hardware specifics (parallelism, vectorization, SIMD, caching, etc),
- work in groups and
- describe their work in a short presentation.
- perform multivariate estimation of running time and memory requirements of algorithms,
- assess the advantages and disadvantages of different algorithms for given data sets,
- analyze different algorithmic approaches presented in scientific publications, develop efficient algorithms from them and produce efficient implementations,
- to use modern algorithmic libraries and adequate data structures to gradually improve their implementation,
- exploit modern hardware specifics (parallelism, vectorization, SIMD, caching, etc),
- work in groups and
- describe their work in a short presentation.
Content
The course provides insights into
- the basic techniques of algorithm engineering, particularly for NP-hard problems,
- design, analysis, implementation, and testing of algorithms,
- speed-ups exploiting features of typical computer architectures, and
- modeling problems and solution methods such as dynamic programming, search tree algorithms, data reduction techniques, and preprocessing for exact, approximate, and heuristic algorithms, as well as strategies based on linear programming (using established solvers).
- the basic techniques of algorithm engineering, particularly for NP-hard problems,
- design, analysis, implementation, and testing of algorithms,
- speed-ups exploiting features of typical computer architectures, and
- modeling problems and solution methods such as dynamic programming, search tree algorithms, data reduction techniques, and preprocessing for exact, approximate, and heuristic algorithms, as well as strategies 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 | Irregular | [de] | 6 | ISIS |
Workload and credit points
Algorithm Engineering (Project)
| Workload description | Multiplier | Hours | Total |
|---|---|---|---|
| Work on milestones | 3 | 60 h | 180 h |
| Attendance | 15 | 6 h | 90 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
Introductory courses present a selected problem (usually from scientific papers) as well as an overview of algorithmic approaches to the problem from the literature. Subsequently, lectures teaching knowledge and methods alternate with project work in small groups. In the group work, students develop efficient implementations for the problem. This involves three stages (milestones):
1. Combinination of promising algorithmic ideas as well as theoretical analysis of the approaches.
2. Implementation of the algorithmic approaches found in step 1 and experimental verification.
3. Improvement of the most suitable implementation following the algorithm engineering cycle.
The results of each of these steps (milestones) will be presented in short lectures.
1. Combinination of promising algorithmic ideas as well as theoretical analysis of the approaches.
2. Implementation of the algorithmic approaches found in step 1 and experimental verification.
3. Improvement of the most suitable implementation following the algorithm engineering cycle.
The results of each of these steps (milestones) will be presented in short lectures.
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", "Algorithms Theory", as well as "Programming Lab: Algorithm Engineering"
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 |
Test elements
| Name | Points/Weight | Category | Duration/Extent |
|---|---|---|---|
| 1. Milestone (theory) | 30 | flexibel | 40 h |
| 2. Milestone (implementation) | 30 | practical | 70 h |
| 3. Milestone (engineering) | 40 | practical | 70 h |
Exam description
For each of the 3 stages, the quality of the associated presentation & results found will be assessed.
In milestones 2 and 3, the performance of the implementation also contributes to the grade.
In milestones 2 and 3, the performance of the implementation also contributes to the grade.
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: Irregular.
Maximum number of participants
The maximum capacity of participants is 15.
Registration procedures
The registration and withdrawal deadlines will be announced in the ISIS-course.
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 |
|---|---|---|
| Computer Engineering Computer Engineering (B. Sc.) - StuPO 2015 | SS 2026 | Wahlpflichtbereich › Informatik |
| WS 2026/27 | Wahlpflichtbereich › Kataloge › Informatik | |
| Computer Engineering Computer Engineering (M. Sc.) - StuPO 2015 | SS 2026 | Wahlpflicht Studiengebiete Fak. IV › Grundlagen der Informatik / Foundations of Computing |
| WS 2026/27 | Wahlpflichtbereich › Studiengebiete Fak. IV › Grundlagen der Informatik / Foundations of Computing | |
| Computer Science (Informatik) Computer Science (Informatik) (M. Sc.) - StuPO 2015 | SS 2026 | Studiengebiete › Data and Software Engineering / Data and Software Engineering |
| WS 2026/27 | Wahlpflichtbereich › Studiengebiet › Data and Software Engineering / Data and Software Engineering | |
| Electrical Engineering Electrical Engineering (M. Sc.) - StuPO 2015 | SS 2026 | Wahlpflicht Studiengebiete Fak. IV › Grundlagen der Informatik / Foundations of Computing |
| WS 2026/27 | Wahlpflichtbereich › Studiengebiete Fak. IV › Grundlagen der Informatik / Foundations of Computing | |
| Industrial Engineering and Management Industrial Engineering and Management (M. Sc.) - StuPO 2015 | SS 2026 | 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 2026/27 | 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 | |
| Industrial Engineering and Management Industrial Engineering and Management (M. Sc.) - StuPO 2026 | WS 2026/27 | Engineering Sciences / Specialization › AI Engineering › Data and Software Engineering |
| Information Systems Management (Wirtschaftsinformatik) Information Systems Management (Wirtschaftsinformatik) (M. Sc.) - StuPO 2017 | SS 2026 | Wahlpflichtbereich › Fachstudium Informatik › Data and Software Engineering |
| WS 2026/27 | Wahlpflichtbereich › Fachstudium Informatik › Data and Software Engineering | |
| Information Technology (teacher training) Kernfach StuPO 2016 | SS 2026 | Fachwissenschaftlicher Wahlpflichtbereich |
| WS 2026/27 | Fachwissenschaftlicher Wahlpflichtbereich | |
| Information Technology (teacher training) Zweitfach StuPO 2016 | SS 2026 | Fachwissenschaftlicher Wahlpflichtbereich |
| WS 2026/27 | Fachwissenschaftlicher Wahlpflichtbereich |
Miscellaneous
This course is not offered regularly, you will find detailed information on our website: https://www.tu.berlin/en/akt/study-and-teaching/courses