269016 VU Algorithms and Data Structures (2020S)
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 Mo 03.02.2020 08:00 to Mo 24.02.2020 07:00
- Deregistration possible until Th 30.04.2020 23:59
Details
max. 25 participants
Language: English
Lecturers
Classes (iCal) - next class is marked with N
Wednesday
04.03.
09:45 - 11:15
Seminarraum 11, Währinger Straße 29 2.OG
Wednesday
11.03.
09:45 - 11:15
Seminarraum 11, Währinger Straße 29 2.OG
Wednesday
18.03.
09:45 - 11:15
Seminarraum 11, Währinger Straße 29 2.OG
Wednesday
25.03.
09:45 - 11:15
Seminarraum 11, Währinger Straße 29 2.OG
Wednesday
01.04.
09:45 - 11:15
Seminarraum 11, Währinger Straße 29 2.OG
Wednesday
22.04.
09:45 - 11:15
Seminarraum 11, Währinger Straße 29 2.OG
Wednesday
29.04.
09:45 - 11:15
Seminarraum 11, Währinger Straße 29 2.OG
Wednesday
06.05.
09:45 - 11:15
Seminarraum 11, Währinger Straße 29 2.OG
Wednesday
13.05.
09:45 - 11:15
Seminarraum 11, Währinger Straße 29 2.OG
Wednesday
20.05.
09:45 - 11:15
Seminarraum 11, Währinger Straße 29 2.OG
Wednesday
27.05.
09:45 - 11:15
Seminarraum 11, Währinger Straße 29 2.OG
Wednesday
03.06.
09:45 - 11:15
Seminarraum 11, Währinger Straße 29 2.OG
Wednesday
10.06.
09:45 - 11:15
Seminarraum 11, Währinger Straße 29 2.OG
Wednesday
17.06.
09:45 - 11:15
Seminarraum 11, Währinger Straße 29 2.OG
Wednesday
24.06.
09:45 - 11:15
Seminarraum 11, Währinger Straße 29 2.OG
Seminarraum 3, Währinger Straße 29 1.UG
Seminarraum 3, Währinger Straße 29 1.UG
Information
Aims, contents and method of the course
The lecture gives an introduction to algorithms and data structures. Topics covered in the lecture are: Complexity and Worst Case Analysis, Lists, Queues, and Stacks, Heaps, Balanced Search Trees, Dynamic Programming, Hash Functions, Divide and Conquer, Sorting Algorithms, Graph Algorithms, LP and ILP, Approximation Algorithms and Greedy Algorithms.
Assessment and permitted materials
As announced via Moodle:- An exam at the end of the semester, which gives up to 40 points. No materials are allowed.
- 3 written quizzes on Moodle, each gives up to 10 points. Using the lecture slides and homework sheets during quizzes is allowed.
- A video presentation, which gives up to 30 points in total:
* 20 points for selection of the topic, slides, and the presentation itself
* 5 points for questions and feedback on fellow students' presentations
* 5 points for answering the questions of fellow students.Written tests may be checked for plagiarism (Turnitin) and oral inquieries on the topic of the test may be made during the evaluation period of four weeks.Update May 29, 2020:
The final exam will take place on Wednesday, June 24, from 9:45 a.m. - 11:15 a.m. in Währingerstraße 29 (room tba).
- 3 written quizzes on Moodle, each gives up to 10 points. Using the lecture slides and homework sheets during quizzes is allowed.
- A video presentation, which gives up to 30 points in total:
* 20 points for selection of the topic, slides, and the presentation itself
* 5 points for questions and feedback on fellow students' presentations
* 5 points for answering the questions of fellow students.Written tests may be checked for plagiarism (Turnitin) and oral inquieries on the topic of the test may be made during the evaluation period of four weeks.Update May 29, 2020:
The final exam will take place on Wednesday, June 24, from 9:45 a.m. - 11:15 a.m. in Währingerstraße 29 (room tba).
Minimum requirements and assessment criteria
No prerequirements.
Assessment criteria:
Percentage of points grade
>= 89% 1
>= 76% 2
>= 63% 3
>= 50% 4
< 50% 5
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 and supplementary material provided on Moodle.
Reading list
"Introduction to Algorithms" by Cormen Leiseron, Rivest, and Stein
"Algorithms Design" by Kleinberg and Tardos
"Algorithms Design" by Kleinberg and Tardos
Association in the course directory
CO-INF3
Last modified: Sa 08.07.2023 00:21