This module introduces students with different categories of advanced algorithms and typical application areas. The students will have a sound understanding of data structures and algorithms for efficiently handling either very large, complex or dynamic data sets or combinations thereof. They will be in a position to evaluate suitable algorithms and to apply them to typical tasks such as efficiently indexing, searching, retrieving, inserting or updating data such as large volumes of hypertext or spatial data.

The students will be familiar with dynamic algorithms used, for example, in artificial intelligence or molecular sciences.

Prerequisites, previous knowledge, entrance competencies

The student has working knowledge of:

  • geometry, linear algebra, algorithms (sorting, searching, hashing) and data structures (linear structures, trees)
  • basics of graph data structures and algorithms
  • complexity of algorithms, logic, probability theory.