Technische Universität Ilmenau

Efficient Algorithms - Modultafeln of TU Ilmenau

The module lists provide information on the degree programmes offered by the TU Ilmenau.

Please refer to the respective study and examination rules and regulations for the legally binding curricula (Annex Curriculum).

You can find all details on planned lectures and classes in the electronic university catalogue.

Information and guidance on the maintenance of module descriptions by the module officers are provided at Module maintenance.

Please send information on missing or incorrect module descriptions directly to modulkatalog@tu-ilmenau.de.

module properties Efficient Algorithms in degree program Bachelor Informatik 2010
ATTENTION: not offered anymore
module number5347
examination number2200058
departmentDepartment of Computer Science and Automation
ID of group 2241 (Automata and Logics)
module leaderProf. Dr. Manfred Kunde
term summer term only
languageDeutsch
credit points4
on-campus program (h)34
self-study (h)86
obligationobligatory module
examoral examination performance, 15 minutes
details of the certificate

Diese Lehrveranstaltung wird nicht mehr angeboten.

alternative examination performance due to COVID-19 regulations incl. technical requirements
signup details for alternative examinations
maximum number of participants
previous knowledge and experience"Algorithmen und Datenstrukturen",
"Algorithmen und Programmierung",
"Mathematik für Informatiker 1 und 2",
"Grundlagen und Diskrete Strukturen"
learning outcome

Diese Lehrveranstaltung wird nicht mehr angeboten.

content1. Sortieren und Auswahlproblem
2. Verwaltung von Mengen
- Union-Find-Datenstrukturen
- Fibonacci-Heaps
- Binomial Queues
3. Graphalgorithmen
- All-Pairs-Shortest-Paths (Floyd)
- Transitive Hülle (Warshall)
- Single-Source-Shortest-Paths (Dijkstra)
- Minimale Spannbäume (Kruskal, Prim,
Maggs/Plotkin)
4. Flüsse in Netzwerken (mit Anwendungen)
- Ford-Fulkerson-Algorithmus
- Algorithmus von Dinic
- Bipartites Matching
5. Arithmetische Algorithmen
- Multiplikation ganzer Zahlen
- Matrixmultiplikation
Designmethoden: Greedy, Dynamische Programmierung, Divide-And-Conquer, Backtracking.
Analysemethoden: Divide-and-Conquer-Rekurrenzen, amortisierte Analyse
media of instruction and technical requirements for education and examination in case of online participation

Tafel, Folien

 

Moodle: https://moodle2.tu-ilmenau.de/enrol/index.php?id=3097

literature / referenceswird in der Vorlesung angegeben
evaluation of teaching

Pflichtevaluation:

SS 2010 (Fach)

Freiwillige Evaluation:

SS 2008 (Vorlesung, Übung)

SS 2010 (Übung)

SS 2011 (Vorlesung, Übung)

SS 2012 (Vorlesung, Übung)

SS 2013 (Vorlesung, Übung)

WS 2013/2014 (Vorlesung, Übung)

Hospitation: