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 27.02.2018. There will be an entry-level test in TUWEL starting on 01.03.2018. This test can be completed until 11.03.2018 (13:00). Registration to one of the exercise groups requires a positiv result for the entry-level test and starts on 12.03.2018 (13:00).

Detailed course information will be presented in a preliminary discussion in the first lecture on 01.03.2018 (11:15 am - 12:45 am, Audi Max). Furthermore, all informations are available in the corresponding TUWEL course.

ECTS-Breakdown: 200h

    52h Lectures
    26h Recap lecture contents
    48h Exercise sheets (48 exercises, 1 hour per exercise)
    4h TUWEL tests (2 tests, 2h per test)
    8h Visit exercise groups
    62h Test preparation (31h per test)

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

• 8x Exercises in groups
• 2x TUWEL tests
• 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 a group registration.

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