Courseview

Algorithms, Data Structures, and Data Abstraction

LV: 19300201

a.SAP verarbeitet

4 SWS

Wolfgang Mulzer

Mahmoud Elashmawi

Lecture

Akt: 01.03.2023 12:01

Tue, 14:00 - 16:00 (T9/Gr. Hörsaal)

Thu, 14:00 - 16:00 (T9/Gr. Hörsaal)

Description

Analysis of sorting algorithms: Mergesort, Quicksort, etc.
ADTs priority queue and dictionary and corresponding data structures: heaps, hashing, binary search trees, B-trees, etc.
Graph algorithms: breadth first search and depth first search, topolocigal sorting, minimum spanning trees, shortest paths.
Analysis on Strings.
Memory-management.
Algorithm design: divide-and-conquer, greedy algorithms, dynamic programming.
Mathematical analysis of algorithms: running time, space.

References

P. Morin: Open Data Structures, an open content textboox.
T. H. Cormen, C. Leiserson, R. Rivest, C. Stein: Introduction to Algorithms, MIT Press, 2009.
R. Sedgewick: Algorithms in Java (Part 1–5), Addison-Wesley, 2003.
G. Saake, S. Sattler: Algorithmen und Datenstrukturen, dpunkt.verlag, 2013.
M. Dietzfelbinger, K. Mehlhorn, P. Sanders. Algorithmen und Datenstrukturen: Die Grundwerkzeuge, Springer, 2014.
M.T. Goodrich, R. Tamassia: Data Structures and Algorithms in Java, Wiley, 2014.

Additional appointments

Klausur

Hs 1a Hörsaal

Hs 1b Hörsaal

Wolfgang Mulzer

Mahmoud Elashmawi

23.02.2023 14:00 - 17:00

Klausureinsicht

T9/055 Seminarraum

Wolfgang Mulzer

Mahmoud Elashmawi

10.03.2023 13:00 - 14:00

Nachklausur

Hs 1a Hörsaal

Wolfgang Mulzer

Mahmoud Elashmawi

13.04.2023 14:00 - 17:00

Appointment series

T9/Gr. Hörsaal

Wolfgang Mulzer

Mahmoud Elashmawi

wöchentlich, ab 18.10.2022, 14:00 - 16:00 (16 Termine)

T9/Gr. Hörsaal

Wolfgang Mulzer

Mahmoud Elashmawi

wöchentlich, ab 20.10.2022, 14:00 - 16:00 (16 Termine)