After successful completion of the course, students are able to describe

• fundamental algorithms and data structues,
• methods to evaluate and analize algorithms, and
• a systematic approach to develop algorithms.

Furthermore, students are able to

• develop algorithms in an abstract way with efficienty in mind,
• use theoretically founded methods to analyze algorithms, and
• apply the knowledge of fundamental algorithms and data structutes.

In addition, stundents are able to develop and present efficient approaches self-organized and on their own responsibility.

• Analysis of algorithms, complexity, notations
• Graph algorithms
• Algorithm paradigms like greedy or divide-and-conquer
• Searching, binary search trees, balanced search trees, hashing
• Sorting algorithms
• Poly-time reductions
• Branch-and-Bound
• Approximation algorithms
• Heuristics and local search
• Dynamic programming
• Further topics (e.g. text search, randomization, geometric algorithms)

Learning activities comprise lectures, assignments in small groups, programming exercises, as well as two written exams (and one make-up test).

We start the semester in presence (lectures, exercise groups, exams). If needed, we will send a TUWEL-announcement that we (partially) switch to distance learning.

This course is scheduled for the second semester.

The TUWEL-course is available from 01.03.2023. There will be an entry-level test in TUWEL starting on 01.03.2022 (20:00). This test can be completed until 17.03.2023 (20:00). Registration to one of the exercise groups requires a positiv result for the entry-level test and starts on 20.03.2023 (20:00).

Detailed course information will be presented in a preliminary discussion in the first lecture on 01.03.2023 at 16:00 (c.t.) in AudiMax GM1. Furthermore, all informations are available in the corresponding TUWEL course.

ECTS-Breakdown: 200h

    50h Lectures
    30h Recap lecture contents
    42h Exercise sheets (42 exercises)
      7h Visit exercise groups
    20h Programming exercises
      1h Visit interviews for prgramming exercises
      4h Attendence tests
    46h Test preparation

For further information contact: algodat@ac.tuwien.ac.at (please use your student-e-mail-account)

• 7x Exercises in groups (for everyone either in presence or online)
• 2x Interview for programming exercises (optional, online)
• 2x Written exams (additionally one make-up test; for everyone either in presence or online)

• basic programming skills (Java)
• basic knowledge of linear algebra and analysis, especially set theory, metrics, sequences and series