Algorithmen und Datenstrukturen

FB20 Computer Science · Offered in SoSe 2026

No grade data reported for this course yet.

Grade distributions arrive when a student who took the course opens their Notenspiegel with the TUPlan extension installed.

Install the extensionNot in the Chrome Web Store yet — for now the link goes to a store search.

Was this course worth it?

No ratings yet — be the first.

Your vote is stored against a random id in this browser. No account, nothing that identifies you.

Weekly sessions · SoSe 2026

Mon08:00–09:40S202/C110 · 01
Mon09:50–11:30S103/109 · 02
Mon09:50–11:30S217/103 · 07
Mon11:40–13:20S103/123 · 04
Mon11:40–13:20S102/344 · 24
Mon11:40–13:20S103/015 · 36
Mon11:40–13:20S102/34 · 37
Mon11:40–13:20S103/312 · 38
Mon13:30–15:10S103/104 · 03
Mon13:30–15:10S202/C110 · 27
Mon15:20–17:00S103/23 · 25
Mon17:10–18:50S103/123 · 06
Tue08:00–09:40S202/C120 · 05
Tue09:50–11:30S105/24 · 08
Tue09:50–11:30S103/102 · 15
Tue09:50–11:30S103/100 · 32
Tue09:50–11:30S103/125 · 33
Tue09:50–11:30S101/A2 · 34
Tue11:40–13:20S202/C110 · 31
Tue13:30–15:10S207/109 · 09
Tue13:30–15:10S103/107 · 14
Tue13:30–15:10S103/112 · 39
Tue13:30–15:10S115/021 · 40
Tue15:20–17:00S101/A1, S101/A01 · Integrierte Veranstaltung
Tue17:10–18:50S103/123 · 12
Wed08:00–09:40S202/C110 · 13
Wed08:00–09:40S103/112 · 20
Wed09:50–11:30S202/C110 · 22
Wed09:50–11:30S103/209 · 29
Wed11:40–13:20S101/A3 · 30
Wed15:20–17:00S202/C120 · 17
Wed17:10–18:50S103/23 · 28
Thu08:00–09:40S101/A1, S101/A01 · Integrierte Veranstaltung
Thu09:50–11:30S101/A3 · 21
Thu11:40–13:20S102/34 · 19
Thu13:30–15:10S103/223 · 18
Thu15:20–17:00S105/22 · 16
Fri09:50–11:30S101/A3 · 26
Fri09:50–11:30S103/112 · 35
Fri11:40–13:20S202/C120 · 23
Fri13:30–15:10S101/A3 · 11
Fri15:20–17:00S102/36 · 10

Parts

20-00-0005-ivIntegrated course8 contact h/week

Language: Deutsch
Taught by: Prof. Ph.D. Zsolt Istvan, Prof. Ph. D. Stefan Roth

Course content

Datenstrukturen: Array, Listen, Binäre Suchbäume, B-Bäume, Graphenrepräsentationen, Hash-Tabellen, Heaps Algorithmen: Sortieralgorithmen, Stringmatching, Traversieren, Einfügen, Suchen und Löschen bei Datenstrukturen, Kürzeste-Wege-Suche, Minimale Spannbäume Asymptotische Komplexität: Laufzeit, Landau-Notation, Klassen P und NP, NP-Vollständigkeit Algorithmisches Strategien, zum Beispiel: Divide-and-Conquer, Dynamische Programmierung, Brute-Force, Greedy, Backtracking, Metaheuristiken

Exam dates

No exam date published.

Add to planner