Study Guide

Objective

You know basic concepts of computation theory and are able to classify problems.
You are able to solve problems and create programs utilising appropriate algorithms and data structures.
You are able to evaluate the time complexity of algorithms.

Content

What do computation and algorithm mean and how are problems classified?
What do data structure and abstract datatype mean?
How are the appropriate algorithm and data structure chosen and programmed to solve problems?
What does the time complexity of an algorithm?
Which methods are used to evaluate the time complexity of algorithms?

Materials

To be settled at the course kick off.

Teaching methods

Scheduled track:
You participate in lectures and exercises or you study independently.

Independent track:
You can show your competence e.g. by a certificate. To be settled at the course kick off.

Employer connections

To be settled later on.

Exam schedules

To be settled later on.

Student workload

135 h

Evaluation scale

1-5

Assessment methods and criteria

To be settled at the course kick off.

Qualifications

Discrete mathematics 2 or equivalent knowledge
Games and gamification or equivalent knowledge
Application programming 3 or equivalent knowledge