Universität Wien FIND

Due to the COVID-19 pandemic, changes to courses and exams may be necessary at short notice (e.g. cancellation of on-site teaching and conversion to online exams). Register for courses/exams via u:space, find out about the current status on u:find and on the moodle learning platform.

Further information about on-site teaching can be found at https://studieren.univie.ac.at/en/info.

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

052100 VU Algorithms and Data Structures 2 (2019S)

Continuous assessment of course work

Registration/Deregistration

Details

max. 25 participants
Language: English

Lecturers

Classes (iCal) - next class is marked with N

Monday 04.03. 09:45 - 11:15 Hörsaal 2, Währinger Straße 29 2.OG
Monday 11.03. 09:45 - 11:15 Hörsaal 2, Währinger Straße 29 2.OG
Monday 18.03. 09:45 - 11:15 Hörsaal 2, Währinger Straße 29 2.OG
Monday 25.03. 09:45 - 11:15 Hörsaal 2, Währinger Straße 29 2.OG
Monday 01.04. 09:45 - 11:15 Hörsaal 2, Währinger Straße 29 2.OG
Monday 08.04. 09:45 - 11:15 Hörsaal 2, Währinger Straße 29 2.OG
Monday 29.04. 09:45 - 11:15 Hörsaal 2, Währinger Straße 29 2.OG
Monday 06.05. 09:45 - 11:15 Hörsaal 2, Währinger Straße 29 2.OG
Monday 13.05. 09:45 - 11:15 Hörsaal 2, Währinger Straße 29 2.OG
Monday 20.05. 09:45 - 11:15 Hörsaal 2, Währinger Straße 29 2.OG
Monday 27.05. 09:45 - 11:15 Hörsaal 2, Währinger Straße 29 2.OG
Monday 03.06. 09:45 - 11:15 Hörsaal 2, Währinger Straße 29 2.OG
Monday 17.06. 09:45 - 11:15 Hörsaal 2, Währinger Straße 29 2.OG
Monday 24.06. 09:45 - 11:15 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 (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 presentations of solutions to homework problems at the white board (there will be 4 homework sheets in total).
Each exam gives 30 pts, each board presentation gives up 10 pts in total.
The exams are closed-book, no notes. For the board presentations you can use your notes.
Attendance is required (except for 3 classes which you can miss without giving a reason).

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 lectures, the homework problems, the slides, and the reading material

Reading list

Will be provided on Moodle.

Association in the course directory

Module: CNA

Last modified: Mo 07.09.2020 15:30