t.BA.IT.ADS.13HS (Algorithms and Data Structures) 
Module: Algorithms and Data Structures
This information was generated on: 28 May 2024
Algorithms and Data Structures
Organised by


Version: 12.0 start 01 August 2022

Short description

  • Students learn how to approach algorithmically complex problems and are familiarized with the central data structures of computer science and their implementation in Java. They are able to estimate computing effort.
  • They learn to apply basic design patterns.

Module coordinator

Spielberger Jürgen (spij)

Learning objectives (competencies)

Ziel Kompetenzen Taxonomiestufen
The students know the central algorithms and data structures of computer science. F K1
Students know basic design patterns for designing new algorithms and can apply them to simple problems. F, M K1, K3
Students can estimate the computational effort of simple algorithms. F, M K3
Students can implement and use algorithms and data structures in Java. F K3

Module contents

General concepts
  • Asymptotic complexity (O-notation)
  • Analysis of algorithms (runtime and storage space)
Algorithm Paradigms
  • Recursion
  • Backtracking
  • Greedy algorithms
  • Divide and Conquer
Data Structures
  • Stack and Queue
  • List
  • Hash table
  • Trees
  • Graphs
  • Searching
  • Tree traversing
  • Rotation in balanced search trees
  • Hash Tables
  • Shortest paths in graphs
  • Width and depth search in graphs
  • Sorting algorithms
  • Runtime requirements
Algorithms in Java
  • Objects/equals/hashCode
  • Comparator/Comparable
  • Collections
  • Generics
  • Iterator

Teaching materials

  • Slides
  • Practicals and accompanying material (in electr. form)

Supplementary literature

  • Saake/Sattler: "Algorithmen und Datenstrukturen: Eine Einführung mit Java"
    5. überarbeitete Auflage 2014, dPunkt Verlag, ISBN 978-3-86490-136-2
  • Sedgewick/Wayne: "Algorithmen: Algorithmen und Datenstrukturen"
    4. aktualisierte Auflage 2014, Pearson Education, ISBN: 978-3-86894-184-5
  • Further documents will be made available as required.


  • THIN: Theoretical Computer Science, especially Runtime (P/NP) and O-Notation
  • PROG1, PROG2: Programming in Java
  • Discrete mathematics: Fundamentals Discrete mathematics

Teaching language

(X) German ( ) English

Part of International Profile

( ) Yes (X) No

Module structure

Type 3a
  For more details please click on this link: T_CL_Modulauspraegungen_SM2025


Description Type Form Scope Grade Weighting
Graded assignments during teaching semester Internships and learning controls written and computerized 14 Weeks Grading 30%
End-of-semester exam Examination  verbally 20 Minutes Grading 70%



Legal basis

The module description is part of the legal basis in addition to the general academic regulations. It is binding. During the first week of the semester a written and communicated supplement can specify the module description in more detail.


Course: Algorithmen und Datenstrukturen - Praktikum
Algorithmen und Datenstrukturen - Praktikum


  • No module description is available in the system for the cut-off date of 01 August 2099.
Course: Algorithmen und Datenstrukturen - Vorlesung
Algorithmen und Datenstrukturen - Vorlesung


  • No module description is available in the system for the cut-off date of 01 August 2099.