052100 VU Algorithms and Data Structures 2 (2022W)
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 We 14.09.2022 09:00 to We 21.09.2022 09:00
- Deregistration possible until Fr 14.10.2022 23:59
Details
max. 50 participants
Language: English
Lecturers
Classes (iCal) - next class is marked with N
Monday
03.10.
09:45 - 11:15
Hörsaal 3, Währinger Straße 29 3.OG
Monday
10.10.
09:45 - 11:15
Hörsaal 3, Währinger Straße 29 3.OG
Monday
17.10.
09:45 - 11:15
Hörsaal 3, Währinger Straße 29 3.OG
Monday
24.10.
09:45 - 11:15
Hörsaal 3, Währinger Straße 29 3.OG
Monday
31.10.
09:45 - 11:15
Hörsaal 3, Währinger Straße 29 3.OG
Monday
07.11.
09:45 - 11:15
Hörsaal 3, Währinger Straße 29 3.OG
Monday
14.11.
09:45 - 11:15
Hörsaal 3, Währinger Straße 29 3.OG
Monday
21.11.
09:45 - 11:15
Hörsaal 3, Währinger Straße 29 3.OG
Monday
28.11.
09:45 - 11:15
Hörsaal 3, Währinger Straße 29 3.OG
Monday
05.12.
09:45 - 11:15
Hörsaal 3, Währinger Straße 29 3.OG
Monday
12.12.
09:45 - 11:15
Hörsaal 3, Währinger Straße 29 3.OG
Monday
09.01.
09:45 - 11:15
Hörsaal 3, Währinger Straße 29 3.OG
Monday
16.01.
09:45 - 11:15
Hörsaal 3, Währinger Straße 29 3.OG
Monday
23.01.
09:45 - 11:15
Hörsaal 3, Währinger Straße 29 3.OG
Monday
30.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
- Exercise sheets (individual work): 40 points
- Written exams (individual work): 60 points
- Written exams (individual work): 60 points
Minimum requirements and assessment criteria
You should already have some basic knowledge of discrete mathematics, algorithms and data structures.Grading:
>= 87% 1
>= 75% 2
>= 63% 3
>= 50% 4
< 50% 5
>= 87% 1
>= 75% 2
>= 63% 3
>= 50% 4
< 50% 5
Examination topics
- Proof techniques
- Algorithmic strategies
- Algorithms for selected problems, e.g., on graphs, strings and sequences
- Algorithmic strategies
- Algorithms for selected problems, e.g., on graphs, strings and sequences
Reading list
Cormen, Thomas H.; Leiserson, Charles E.; Rivest, Ronald L.; Stein, Clifford. Introduction to Algorithms. MIT Press and McGraw-Hill.Further literature will be provided via Moodle.
Association in the course directory
Last modified: We 30.11.2022 17:48
- Proof techniques, e.g., induction
- Algorithmic strategies, e.g., backtracking, reduction, dynamic programming, greedy algorithms
- Algorithms for selected problems, e.g., maximum flow, vertex cover, minimum spanning tree, string and pattern matching, hashing, geometric algorithms, scheduling
- Fixed-parameter tractable algorithms