Universität Wien
Warning! The directory is not yet complete and will be amended until the beginning of the term.

262014 VU Algorithms and Data Structures for Computational Science (2025S)

4.00 ECTS (3.00 SWS), SPL 26 - Physik
Continuous assessment of course work
Tu 04.03. 15:00-16:30 Seminarraum 9, Kolingasse 14-16, OG01

Registration/Deregistration

Note: The time of your registration within the registration period has no effect on the allocation of places (no first come, first served).

Details

max. 25 participants
Language: English

Lecturers

Classes (iCal) - next class is marked with N

  • Thursday 06.03. 15:00 - 16:30 Seminarraum 9, Kolingasse 14-16, OG01
  • Tuesday 11.03. 15:00 - 16:30 Seminarraum 9, Kolingasse 14-16, OG01
  • Thursday 13.03. 15:00 - 16:30 Seminarraum 9, Kolingasse 14-16, OG01
  • Tuesday 18.03. 15:00 - 16:30 Seminarraum 9, Kolingasse 14-16, OG01
  • Thursday 20.03. 15:00 - 16:30 Seminarraum 9, Kolingasse 14-16, OG01
  • Tuesday 25.03. 15:00 - 16:30 Seminarraum 9, Kolingasse 14-16, OG01
  • Thursday 27.03. 15:00 - 16:30 Seminarraum 9, Kolingasse 14-16, OG01
  • Tuesday 01.04. 15:00 - 16:30 Seminarraum 9, Kolingasse 14-16, OG01
  • Thursday 03.04. 15:00 - 16:30 Seminarraum 9, Kolingasse 14-16, OG01
  • Tuesday 08.04. 15:00 - 16:30 Seminarraum 9, Kolingasse 14-16, OG01
  • Thursday 10.04. 15:00 - 16:30 Seminarraum 9, Kolingasse 14-16, OG01
  • Tuesday 29.04. 15:00 - 16:30 Seminarraum 9, Kolingasse 14-16, OG01
  • Tuesday 06.05. 15:00 - 16:30 Seminarraum 9, Kolingasse 14-16, OG01
  • Thursday 08.05. 15:00 - 16:30 Seminarraum 9, Kolingasse 14-16, OG01
  • Tuesday 13.05. 15:00 - 16:30 Seminarraum 9, Kolingasse 14-16, OG01
  • Thursday 15.05. 15:00 - 16:30 Seminarraum 9, Kolingasse 14-16, OG01
  • Tuesday 20.05. 15:00 - 16:30 Seminarraum 9, Kolingasse 14-16, OG01
  • Thursday 22.05. 15:00 - 16:30 Seminarraum 9, Kolingasse 14-16, OG01
  • Tuesday 27.05. 15:00 - 16:30 Seminarraum 9, Kolingasse 14-16, OG01
  • Tuesday 03.06. 15:00 - 16:30 Seminarraum 9, Kolingasse 14-16, OG01
  • Thursday 05.06. 15:00 - 16:30 Seminarraum 9, Kolingasse 14-16, OG01
  • Tuesday 10.06. 15:00 - 16:30 Seminarraum 9, Kolingasse 14-16, OG01
  • Thursday 12.06. 15:00 - 16:30 Seminarraum 9, Kolingasse 14-16, OG01
  • Tuesday 17.06. 15:00 - 16:30 Seminarraum 9, Kolingasse 14-16, OG01
  • Tuesday 24.06. 15:00 - 16:30 Seminarraum 9, Kolingasse 14-16, OG01

Information

Aims, contents and method of the course

We will study some more advanced topics in algorithms and data structures, such as:
- design and analysis of algorithms especially for graph and clustering problems
- efficient exact and approximation algorithms for optimization problems (greedy algorithms, Linear Programming)
- algorithms for big data (online algorithms, streaming algorithms, external memory algorithms)

On successful completion of this course, you will be familiar with the above concepts and methods and able to use them on your own in practice.

The schedule consists of interactive lectures as well as homework presentations and discussions.

Students are expected to have acquired basic knowledge in algorithms and data structures, e.g. 051024 VU Algorithms and Data Structures 1, prior to taking this course. See also the Extension Curriculum Basic Knowledge in Computational Sciences.

If you are unsure whether you meet these prerequirements, please contact the lecturer(s).

Assessment and permitted materials

A total of 100 regular points (100%) can be reached.

The number of lectures will be divided into two roughly equally-sized sections. In each of the two sections, there will be
- 1 written exam (90 minutes) for up to 40 regular points,
- 2 homework sheets with several small problems each, one of them needs to be presented in class for up to 10 regular points,
resulting in 2 * (40 + 10) = 100 regular points.
No materials are allowed for the written exams.

Up to 25 bonus points can be reached:
- 5 bonus points if you miss at most 2 classes (-1 for every further missed class)
- up to 5 bonus points per semester half (= 2*5 in total) for solving one of the extra problems on a homework sheet
- x <= 2.5 bonus points per homework sheet (= 4*2.5 in total) for readiness to present >= x+1 problems on that sheet in class

Preliminary dates for the exams:
TBA

Minimum requirements and assessment criteria

If P is the sum of regular and bonus points received, your grade will be:

1, if P >= 89,
2, if P >= 76,
3, if P >= 63,
4, if P >= 50,
5, otherwise.

Presence is mandatory for the first lecture. Otherwise, it is not a requirement, but strongly recommended.
If you fail to show up for an exam, you will receive 0 points for this exam.

Homework sheets must be submitted before the deadline to be eligible for presentation in class. You can indicate for each problem on a homework sheet whether you would be willing to present it. The presenter for each problem is chosen by the instructors among all those that are willing to present, with ties broken randomly. There will be enough problems so that each student can present twice if everyone is willing to present all problems. If you fail to submit a homework sheet or are not chosen for presentation because you were unwilling to present many of the subproblems or are chosen to present but don't show up, you will receive 0 points.

Examination topics

- all material presented and discussed in class
- contents and discussion of all exercise sheets
- reading material as provided on Moodle

Reading list

Literature will be announced in class and (as far as possible) made available on Moodle.

Association in the course directory

PM-ADS

Last modified: Th 30.01.2025 18:06