Inhalt
[ INBIPUEALG2 ] UE (*)Algorithmen und Datenstrukturen 2
|
|
|
| Es ist eine neuere Version 2025W dieser LV im Curriculum Bachelor's programme Artificial Intelligence 2025W vorhanden. |
|
| (*) Unfortunately this information is not available in english. |
 |
| Workload |
Education level |
Study areas |
Responsible person |
Hours per week |
Coordinating university |
| 1,5 ECTS |
B2 - Bachelor's programme 2. year |
Computer Science |
Alois Ferscha |
1 hpw |
Johannes Kepler University Linz |
|
|
|
| Detailed information |
| Original study plan |
Bachelor's programme Computer Science 2012W |
| Objectives |
(*)Vermittlung fortgeschrittener Algorithmen und Datenstrukturen, insbesondere dynamische Datenstrukturen und ihre Anwendungen.
|
| Subject |
(*)Dynamische Datenstrukturen (Listen, Bäume, Graphen, Stacks, Queues, Mengen),
Heaps, Skip Listen, Splay Trees, fortgeschrittene Sortieralgorithmen (Mergesort, Heapsort, Radixsort), balancierte Bäume, Hashing, Graphalgorithmen, geometrische Algorithmen, Multimedia-Algorithmen, parallele Algorithmen, verteilte Algorithmen, heuristische Algorithmen.
|
| Criteria for evaluation |
|
| Language |
German |
| Changing subject? |
No |
| Corresponding lecture |
(*)INBPDUEALG2: UE Algorithmen und Datenstrukturen 2 (1,5 ECTS)
|
|
|
|
| On-site course |
| Maximum number of participants |
35 |
| Assignment procedure |
Direct assignment |
|
|
|
