Algorithms and Data StructuresModule description #40022 / Version 11
- 6 CP
- Written exam
- Graded
- Summer semester
- German
| Module / Version | #40022 / #11 |
|---|---|
| Validity | Since Summer semester 2026 |
| Available language(s) | English, German |
| Credit points | 6 |
| Person responsible for the module | Blankertz, Benjamin |
| Grading | Graded |
| Exam format | Written exam |
| Language(s) of instruction | German |
Affiliation
| Faculty | Fakultät IV |
|---|---|
| Institute | Institut für Softwaretechnik und Theoretische Informatik |
| Academic chair | 34355200 FG S-Professur Neurotechnologie |
Contact
| Office | MAR 5-1 |
|---|---|
| Contact person | Pfisterer, Adrian |
| E-mail address | algodat@robotics.tu-berlin.de |
| Website | http://www.robotics.tu-berlin.de/menue/teaching/ |
Learning outcomes
Students have knowledge of the essential data structures and algorithms. They are confident in selecting appropriate algorithms and data structures for a given problem. They have an awareness of the importance of efficiency of algorithms in terms of sustainability. Students have a basic knowledge of object-oriented programming and the ability to efficiently implement algorithms and apply them to problems.
Content
* Introduction to object-oriented programming in Java
* Complexity classes, Big-O notation
* Backtracking
* Greedy algorithms
* Branch-and-Bound, Alpha-Beta search
* Randomized algorithms
* Dynamic programming
* Depth- and breadth-first search on graphs, Topological sorting
* Minimal spanning trees
* Shortest paths (SSSP)
* Flow graphs, MaxFlow and MinCut
* Heuristic and Approximative Algorithms
* Hash Tables
* Complexity classes, Big-O notation
* Backtracking
* Greedy algorithms
* Branch-and-Bound, Alpha-Beta search
* Randomized algorithms
* Dynamic programming
* Depth- and breadth-first search on graphs, Topological sorting
* Minimal spanning trees
* Shortest paths (SSSP)
* Flow graphs, MaxFlow and MinCut
* Heuristic and Approximative Algorithms
* Hash Tables
Module components
Compulsory area
The following courses are mandatory for this module:
Workload and credit points
Algorithmen und Datenstrukturen (Lecture)
| Workload description | Multiplier | Hours | Total |
|---|---|---|---|
| Attendence | 15 | 2 h | 30 h |
| Pre-/post processing | 15 | 2 h | 30 h |
| 60 h | |||
Algorithmen und Datenstrukturen (Exercise)
| Workload description | Multiplier | Hours | Total |
|---|---|---|---|
| Attendence | 15 | 2 h | 30 h |
| Pre-/post processing | 15 | 2 h | 30 h |
| 60 h | |||
Course-independent workload
| Workload description | Multiplier | Hours | Total |
|---|---|---|---|
| exam preperation | 1 | 60 h | 60 h |
| 60 h | |||
The workload of the module adds up to 180 hours. The module therefore comprises 6 credit points.
Description of teaching and learning methods
Lecture to convey the material, with accompanying weekly exercises for consolidation and practice. Exercise sheets and programming tasks are completed individually. Furthermore, a digital script and videos are available for self-study.
Requirements for participation and examination
Desirable prerequisites for participation in the courses:
Knowledge in the scope of the module “Introduction to programming”
Mandatory requirements for the module examination registration:
The examination requirements could not be retrieved.
Completion of the module
| Grading | Graded |
|---|---|
| Exam format | Written exam |
| Language | German |
| Duration/Extent | 90 minutes |
Exam description
The ungraded midterm examination takes place during the lecture period. Passing the midterm is a prerequisite for admission to the final exam. The written test is held after the end of the lecture period.
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: Summer semester.
Maximum number of participants
This module is not limited to a number of students.
Registration procedures
The allocation of exercises is done via MOSES in the first week of lectures. Registration and deregistration deadlines will be announced in the lecture.
Recommended reading, lecture notes
Lecture notes
unavailable
Electronic lecture notes
available – see ISIS website
Recommended literature
- Blankertz B, Röhr V, Algorithmen und Datenstrukturen, Skript zur Vorlesung, 2020.
- Segdewick R, Wayne K, Algorithmen: Algorithmen und Datenstrukturen. Pearson Studium, 4. Auflage, 2014. ISBN: 978-3868941845
- Ottmann T, Widmayer P, Algorithmen und Datenstrukturen. Springer Verlag, 5. Auflage; 2011. ISBN: 978-3827428042.
- Cormen TH, Leiserson CE, Rivest R, Stein C, Algorithmen - Eine Einführung. De Gruyter Oldenbourg, 4. Auflage; 2013. ISBN: 978-3486748611.
- Ullenboom C, Java ist auch eine Insel. http://openbook.rheinwerk-verlag.de/javainsel
- Sedgewick R, Wayne K, Introduction to Programming in Java: An Interdisciplinary Approach. https://introcs.cs.princeton.edu/java
Assigned programs
This module version is used in the following programs:
| Program / program version | Semester(s) | Curriculum component |
|---|---|---|
| Computational Engineering Science (Informationstechnik im Maschinenwesen) StuPO 2018 | SS 2026 | 5. Ingenieurwissenschaftliche Wahlpflichtmodule › 5.5 Informationstechnik |
| WS 2026/27 | 5. Ingenieurwissenschaftliche Wahlpflichtmodule › 5.5 Informationstechnik | |
| Computer Engineering Computer Engineering (B. Sc.) - StuPO 2015 | SS 2026 | Pflichtbereich |
| WS 2026/27 | Pflichtbereich › Grundlagen der Informatik | |
| Computer Science Computer Science (B. Sc.) - StuPO 2015 | SS 2026 | Pflichtbereich |
| WS 2026/27 | Pflichtbereich › Methodisch-praktische Grundlagen der Informatik | |
| Computer Science Computer Science (B. Sc.) - StuPO 2025 | WS 2026/27 | Pflichtbereich › Mathematisch-algorithmisch-konzeptionelle Kompetenzen |
| Digital Media and Technology Digital Media and Technology (B. Sc.) - StuPO 2015 | SS 2026 | Pflichtbereich |
| WS 2026/27 | Pflichtbereich › Grundlagen der Informatik | |
| Electrical Engineering and Information Technology (Q-Master ET/IT, teacher training) Anlage 3 - StuPO 2016 | SS 2026 | Fachwissenschaftlicher Pflichtbereich |
| WS 2026/27 | Fachwissenschaftlicher Pflichtbereich | |
| Information Technology (teacher training) Kernfach StuPO 2016 | SS 2026 | Fachwissenschaft › Fachwissenschaftlicher Pflichtbereich |
| WS 2026/27 | Fachwissenschaft › Fachwissenschaftlicher Pflichtbereich | |
| Information Technology (teacher training) Zweitfach StuPO 2016 | SS 2026 | Fachwissenschaft › Fachwissenschaftlicher Pflichtbereich |
| WS 2026/27 | Fachwissenschaft › Fachwissenschaftlicher Pflichtbereich | |
| MINTgruen pre-study orientation program MINTgruen pre-study orientation program (OS.) - Studienaufbau MINTgrün | SS 2026 | Wahlpflicht MINT › Module aus der Informatik |
| WS 2026/27 | Wahlpflicht MINT › Module aus der Informatik | |
| Media Technology Media Technology (B. Sc.) - StuPO 2018 | SS 2026 | Pflichtbereich › Grundlagen der Informatik |
| WS 2026/27 | Pflichtbereich › Grundlagen der Informatik | |
| Natural Sciences in the Information Society StuPO 2018 | SS 2026 | Wahlpflichtbereich › Informatik › Grundlagenmodule |
| WS 2026/27 | Wahlpflichtbereich › Informatik › Grundlagenmodule | |
| Natural Sciences in the Information Society Natural Sciences in the Information Society (B. Sc.) - StuPO 2025 | SS 2026 | Wahlpflichtbereich › Wahlpflichtbereich Informatik › Grundlagenmodule Informatik |
| WS 2026/27 | Wahlpflichtbereich › Wahlpflichtbereich Informatik › Grundlagenmodule Informatik |
Miscellaneous
Not specified