Module: Algorithms and Data Structures
This information was generated on: 27 September 2021
No.
Title
Algorithms and Data Structures
Organised by
T CAI
Credits
4

### Description

Version: 3.0 start 01 August 2021

#### Short description

Students cover basic algorithms and data structures of computer science. They learn to solve algorithmically complex tasks, know the central data structures of computer science and how they are implemented in Python, and can estimate the computational effort of programs and apply basic design patterns.

#### 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 Python. F K3

#### Module contents

General concepts
• Asymptotic complexity (O-notation)
• Analysis of algorithms (runtime and storage space)
• Recursion
• Backtracking
• Greedy algorithms
• Divide and Conquer
Data Structures
• Stack and Queue
• List
• Hash table
• Tree
• Graph
Algorithms
• Search
• Tree traversal
• Rotation in balanced search trees
• Hashing
• Shortest paths in graphs
• Width and depth first search in graphs
• Minimum spanning trees
• Sorting
• Runtime requirements and lower bounds

#### Teaching materials

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

#### Supplementary literature

• Sedgewick/Wayne: "Algorithmen: Algorithmen und Datenstrukturen"
4. aktualisierte Auflage 2014, Pearson Education, ISBN: 978-3-86894-184-5 (also available in English)
• Further documents will be made available as required.

#### Prerequisites

• PROG1, PROG2: Programming in Python

#### Teaching language

(X) German ( ) English

( ) Yes (X) No

Type 3a

#### Exams

 Description Type Form Scope Grade Weighting Graded assignments during teaching semester Labs 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.

### Note

Course: Algorithmen und Datenstrukturen - Praktikum
No.
Title
Algorithmen und Datenstrukturen - Praktikum

### Note

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