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

... formulate algorithms that solve problems on discrete structures (e.g. sort a list, find the shortest path between two vertices in a graph, ...)
... understand and use various kinds of design strategies for algorithms (e.g. "divide and conquer", greedy algorithms, ...)
... make some basic estimates on the runtime of an algorithm.

Algorithms

Solving and presenting exercises.

General information in the first lecture.  Please register for the exercise session in one group via TISS.

1st unit: 17.10.

The grade is based on homework assignments in TUWEL, participation in class and presentations on blackboard, as well as on the results of the two short written exams.

Notice: Registration only in one of the groups!!