Modul

See partial achievements (Teilleistung)

Students acquire a systematic understanding of algorithmic issues and
solution approaches in the area of advanced data structures, building
on existing knowledge in the subject area of algorithms. They will
also be able to apply learned techniques to related problems and
interpret and comprehend current research topics in this area.

Upon successful completion of the course, students will be able to:
• explain terms, structures, basic problem definitions, and algorithms from the lecture;
• select which algorithms and data structures are suitable for solving a problem and, if necessary, adapt them to the requirements of a specific problem;
• use algorithms and data structures, analyze them mathematically, and prove the algorithmic properties.

See partial achievements (Teilleistung)

In this lecture we deal with modern data structures for fundamental
objects such as trees, graphs, integers, and strings. These data
structures are the basis for many applications and an important part
of efficient algorithms. We look at highlights from different research
areas and learn techniques for solving a wide variety of problems.

In addition to the theoretical analysis of data structures, we also
look at the practical performance of the various data structures and
their applications.

The lectures including the project/experiment with 5 CP corresponds to 150 working hours, which are divided approximately as follows:
• ca. 30 hours attending lectures
• ca. 60 hours preparing and following-up lectures
• ca. 30 hours working on the project/experiment
• ca. 30 hours preparing for the examination