Algorithmic thinking and understanding and application of:

• Pseudocode
• Algorithm analysis
• Basic algorithms
• Basic data structures
• Advanced methods for analyzing algorithms
• Advanced algorithms
• Basic knowledge of combinatorial optimization

• 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)

This course is scheduled for the second semester.

The TUWEL-course is available from 06.03.2019. There will be an entry-level test in TUWEL starting on 07.03.2019 (15:00). This test can be completed until 17.03.2019 (13:00). Registration to one of the exercise groups requires a positiv result for the entry-level test and starts on 18.03.2019 (11:30).

Detailed course information will be presented in a preliminary discussion in the first lecture on 06.03.2019 at 9am (c.t.) in the Audi Max. Furthermore, all informations are available in the corresponding TUWEL course.

ECTS-Breakdown: 200h

    52h Lectures
    26h Recap lecture contents
    50h Exercise sheets (45 exercises)
      7h Visit exercise groups
    14h Programming exercises
      1h Visit interviews for prgramming exercises
    50h Test preparation

For further information contact: algodat@ac.tuwien.ac.at

• 7x Exercises in groups
• 2x Interview for programming exercises
• 2x Written exams (additionally one make-up test)

Registration is compulsory. The registration is followed by an online test (TUWEL). A positiv result in the online test permits to participate in the course.

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