Algorithms and Data StructuresModule description #40022 / Version 9
- 6 CP
- Portfolio examination
- Graded
- Summer semester
- German
This module description is not valid in the current semester (Winter semester 2026/27).
Current version (v11)
| Module / Version | #40022 / #9 |
|---|---|
| Validity | Summer semester 2023 – Winter semester 2023/24 |
| Available language(s) | German |
| Credit points | 6 |
| Person responsible for the module | Blankertz, Benjamin |
| 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 | 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 |
|---|---|---|---|
| Präsenzzeit | 15 | 2 h | 30 h |
| Vor-/Nachbereitung | 15 | 4 h | 60 h |
| 90 h | |||
Algorithmen und Datenstrukturen (Exercise)
| Workload description | Multiplier | Hours | Total |
|---|---|---|---|
| Präsenzzeit | 15 | 2 h | 30 h |
| Vor-/Nachbereitung | 15 | 4 h | 60 h |
| 90 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 (tutorials) for consolidation and practice. The work on exercise sheets and programming tasks is done in small groups. 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 "Einf¨¨ührung in die Programmierung"
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 | German |
Test elements
| Name | Points/Weight | Category | Duration/Extent |
|---|---|---|---|
| 10 Übungsblätter zu je 5 Punkten | 50 | practical | 1-2 Seiten, Programmcode |
| Schriftlicher Test | 50 | written | 60 Minuten |
Exam description
The exercise sheets will be handed out weekly during the lecture period and submitted in individual hand-ins. The written test takes place 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 tutorials is done via MOSES in the first week of lectures. Registration for exams is done via MOSES or QISPOS. Registration and deregistration deadlines will be announced in the lecture. Teaching materials are provided via ISIS.
Recommended reading, lecture notes
Lecture notes
unavailable
Electronic lecture notes
available – Siehe ISIS Seite
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 is not used in any program.
Miscellaneous
Not specified