052100 VU Algorithms and Data Structures 2 (2019W)
Continuous assessment of course work
Labels
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).
- Registration is open from Sa 07.09.2019 09:00 to Mo 23.09.2019 09:00
- Deregistration possible until Mo 14.10.2019 23:59
Details
max. 50 participants
Language: English
Lecturers
Classes (iCal) - next class is marked with N
Monday
07.10.
09:45 - 11:15
Hörsaal 3, Währinger Straße 29 3.OG
Monday
14.10.
09:45 - 11:15
Hörsaal 3, Währinger Straße 29 3.OG
Monday
21.10.
09:45 - 11:15
Hörsaal 3, Währinger Straße 29 3.OG
Monday
28.10.
09:45 - 11:15
Hörsaal 3, Währinger Straße 29 3.OG
Monday
04.11.
09:45 - 11:15
Hörsaal 3, Währinger Straße 29 3.OG
Monday
11.11.
09:45 - 11:15
Hörsaal 3, Währinger Straße 29 3.OG
Monday
18.11.
09:45 - 11:15
Hörsaal 3, Währinger Straße 29 3.OG
Monday
25.11.
09:45 - 11:15
Hörsaal 3, Währinger Straße 29 3.OG
Monday
02.12.
09:45 - 11:15
Hörsaal 3, Währinger Straße 29 3.OG
Monday
09.12.
09:45 - 11:15
Hörsaal 3, Währinger Straße 29 3.OG
Monday
16.12.
09:45 - 11:15
Hörsaal 3, Währinger Straße 29 3.OG
Monday
13.01.
09:45 - 11:15
Hörsaal 3, Währinger Straße 29 3.OG
Monday
20.01.
09:45 - 11:15
Hörsaal 3, Währinger Straße 29 3.OG
Monday
27.01.
09:45 - 11:15
Hörsaal 3, Währinger Straße 29 3.OG
Information
Aims, contents and method of the course
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.
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
>= 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:20
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)