Courseview

Algorithms, Data Structures, and Data Abstraction

LV: 19300201

a.SAP verarbeitet

4 SWS

Günther Rothe

Lecture

Akt: 04.03.2021 11:11

Tue, 14:00 - 16:00 (Virtueller Raum 03)

Thu, 14:00 - 16:00 (Virtueller Raum 03)

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

Virtueller Raum 01

Günther Rothe

02.03.2021 14:00 - 16:00

Nachklausur

Virtueller Raum 01

Günther Rothe

06.04.2021 13:30 - 14:00

Algorithmen, Datenstrukturen und Datenabstraktion

Virtueller Raum 02

Günther Rothe

06.04.2021 14:00 - 16:00

Appointment series

Virtueller Raum 03

Günther Rothe

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

Virtueller Raum 03

Günther Rothe

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