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

052100 VU Algorithms and Data Structures 2 (2018W)

3.00 ECTS (2.00 SWS), SPL 5 - Informatik und Wirtschaftsinformatik
Continuous assessment of course work
Moodle

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. 50 participants
Language: English

Lecturers

Classes (iCal) - next class is marked with N

  • Monday 01.10. 08:00 - 09:30 Hörsaal 2, Währinger Straße 29 2.OG
  • Monday 08.10. 08:00 - 09:30 Hörsaal 2, Währinger Straße 29 2.OG
  • Monday 15.10. 08:00 - 09:30 Hörsaal 2, Währinger Straße 29 2.OG
  • Monday 22.10. 08:00 - 09:30 Hörsaal 2, Währinger Straße 29 2.OG
  • Monday 29.10. 08:00 - 09:30 Hörsaal 2, Währinger Straße 29 2.OG
  • Monday 05.11. 08:00 - 09:30 Hörsaal 2, Währinger Straße 29 2.OG
  • Monday 12.11. 08:00 - 09:30 Hörsaal 2, Währinger Straße 29 2.OG
  • Monday 19.11. 08:00 - 09:30 Hörsaal 2, Währinger Straße 29 2.OG
  • Monday 26.11. 08:00 - 09:30 Hörsaal 2, Währinger Straße 29 2.OG
  • Monday 03.12. 08:00 - 09:30 Hörsaal 2, Währinger Straße 29 2.OG
  • Monday 10.12. 08:00 - 09:30 Hörsaal 2, Währinger Straße 29 2.OG
  • Monday 07.01. 08:00 - 09:30 Hörsaal 2, Währinger Straße 29 2.OG
  • Monday 14.01. 08:00 - 09:30 Hörsaal 2, Währinger Straße 29 2.OG
  • Monday 21.01. 08:00 - 09:30 Hörsaal 2, Währinger Straße 29 2.OG
  • Monday 28.01. 08:00 - 09:30 Hörsaal 2, Währinger Straße 29 2.OG

Information

Aims, contents and method of the course

Algorithmic Strategies (Recursive Backtracking, Branch and Bound; heuristics; reduction transform and conquer)
Fundamental Data Structures and Algorithms (Tabulation hashing; Pattern matching and string/text algorithms)
Advanced Data Structures, Algorithms and Analysis (External memory algorithms (e.g. B-trees), string-based data structures and algorithms (e.g. suffix trees), network flows, geometric algorithms, (e.g. geometric search/proximity, convex hull) randomized algorithms)

Assessment and permitted materials

There will be two exams as well as 1-2 lecture scribes;
Each exam gives 40pt, scribes give 20pts in total.
Attendance is required (except for 2 classes which you can miss without giving a reason). Every additional missed class reduces the number of achieved points by 5.

Minimum requirements and assessment criteria

percentage of points grade
>= 89% 1
>= 76% 2
>= 63% 3
>= 50% 4
< 50% 5

Examination topics

Everything covered in the lecture, the slides, and the reading material

Reading list

This information will be given in class.

Association in the course directory

Last modified: Mo 07.09.2020 15:30