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

051024 VU Algorithms and Data Structures 1 (2025S)

6.00 ECTS (4.00 SWS), SPL 5 - Informatik und Wirtschaftsinformatik
Continuous assessment of course work
Moodle
Tu 04.03. 08:00-11:15 Hörsaal 1, Währinger Straße 29 1.UG

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).
Register/Deregister for this course

Details

max. 50 participants
Language: German, English

Lecturers

Classes (iCal) - next class is marked with N

  • Tuesday 11.03. 08:00 - 11:15 Hörsaal 1, Währinger Straße 29 1.UG
  • Tuesday 18.03. 08:00 - 11:15 Hörsaal 1, Währinger Straße 29 1.UG
  • Tuesday 25.03. 08:00 - 11:15 Hörsaal 1, Währinger Straße 29 1.UG
  • Tuesday 01.04. 08:00 - 11:15 Hörsaal 1, Währinger Straße 29 1.UG
  • Tuesday 08.04. 08:00 - 11:15 Hörsaal 1, Währinger Straße 29 1.UG
  • Tuesday 29.04. 08:00 - 11:15 Hörsaal 1, Währinger Straße 29 1.UG
  • Tuesday 06.05. 08:00 - 11:15 Hörsaal 1, Währinger Straße 29 1.UG
  • Tuesday 13.05. 08:00 - 11:15 Hörsaal 1, Währinger Straße 29 1.UG
  • Tuesday 20.05. 08:00 - 11:15 Hörsaal 1, Währinger Straße 29 1.UG
  • Tuesday 27.05. 08:00 - 11:15 Hörsaal 1, Währinger Straße 29 1.UG
  • Tuesday 03.06. 08:00 - 11:15 Hörsaal 1, Währinger Straße 29 1.UG
  • Tuesday 10.06. 08:00 - 11:15 Hörsaal 1, Währinger Straße 29 1.UG
  • Tuesday 17.06. 08:00 - 11:15 Hörsaal 1, Währinger Straße 29 1.UG
  • Tuesday 24.06. 08:00 - 11:15 Hörsaal 1, Währinger Straße 29 1.UG
  • Tuesday 01.07. 08:00 - 11:15 Hörsaal 1, Währinger Straße 29 1.UG
  • Tuesday 01.07. 09:45 - 11:15 Hörsaal C1 UniCampus Hof 2 2G-O1-03

Information

Aims, contents and method of the course

In this course students will acquire knowledge of basic data structures, search and sorting algorithms as well as basic graph and optimization algorithms. Students will learn how to estimate the costs of an algorithm using complexity measures. The goal is to design algorithms and data structures for a given problem and learn how to assess its performance.

Contents:
1. Introduction
2. Algorithms
3. Vectors
4. Lists
5. Trees
6. Graphs

The course will be taught in English and German. There will be exercises, which students can solve independently. Solutions to these exercises will be discussed in a tutorial that takes place online at a time slot students will vote for during the first week. While being voluntary, we strongly recommend to attend the tutorial, as it will help to internalize the concepts discussed in the course.

Prerequisites for this course are basic knowledge in mathematics and programming in C++, as taught in the StEOP.

Assessment and permitted materials

During the semester there will be three short exams. These take 45 minutes, follow the same rules as the final exam and will be executed between 8am and 10am before the lecture. The exam dates are planned to be week 4 (March 25, 2025), week 8 (May 6, 2025) and week 13 (June 10, 2025). The two best results out of the three exams count, a maximum of 45 points can be achieved.

Furthermore, there will be three coding projects that can be solved online independently throughout the semester and give up to 45 points in total (15 points each). Students can choose three among five optional topics.

There will be a written exam at the end of the course (July 1, 2025), a retake exam will be offered in September. Student are only admitted to the exam if they reached at least a total of 20 points in the short exams and 20 points in the coding exercises. The exam takes 90 minutes and comprises 90 points; a minimum of 45 points is required to pass this course. The examination topics comprise the entire contents of the lecture. Students will be required to apply the concepts seen in the course. No lecture notes or other helping materials are permitted.

Minimum requirements and assessment criteria

For a passing grade an overall score of 90 points is required. For the individual parts, a minimum of 20 points in the short exams, a minimum of 20 points for the coding exercises and a minimum of 45 points for the final exam are required. The students will be required to understand the concepts taught in the course and apply them.

Grading: S>=150: 1, 150>S>=130: 2, 130>S>=110: 3, 110>S>=90: 4, 90>S: 5 (S denoting the sum of points for all parts)

Examination topics

All topics discussed in the course are examinable.

Reading list

- Thomas H. Cormen, Charles E. Leiserson, and Ronald L. Rivest, Introduction to Algorithms, published by MIT Press and McGraw-Hill. (First published in 1990.)

- R. Sedgewick, Algorithmen in C++ (Teil 1-4), Addison Wesley, 3. überarbeitete Auflage, 2002.

Association in the course directory

Module: ADS UF-INF-09

Last modified: Tu 18.02.2025 10:06