Universität Wien

269016 VU Algorithms and Data Structures (2022S)

3.00 ECTS (2.00 SWS), SPL 26 - Physik
Continuous assessment of course work

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

Lecturers

Classes (iCal) - next class is marked with N

UPDATE on Feb 28/Mar 01, 2022: It will be possible to attend the first class online via Moodle or a guest link, which has been sent by e-mail to all registered and preregistered students.

UPDATE on March 02, 2022: Online participation will be possible for all classes except for the midterm and final exams.

Wednesday 02.03. 09:45 - 11:15 Seminarraum 10, Kolingasse 14-16, OG01
Wednesday 09.03. 09:45 - 11:15 Seminarraum 10, Kolingasse 14-16, OG01
Wednesday 16.03. 09:45 - 11:15 Seminarraum 10, Kolingasse 14-16, OG01
Wednesday 23.03. 09:45 - 11:15 Seminarraum 10, Kolingasse 14-16, OG01
Wednesday 30.03. 09:45 - 11:15 Seminarraum 10, Kolingasse 14-16, OG01
Wednesday 06.04. 09:45 - 11:15 Seminarraum 10, Kolingasse 14-16, OG01
Wednesday 27.04. 09:45 - 11:15 Seminarraum 10, Kolingasse 14-16, OG01
Wednesday 04.05. 09:45 - 11:15 PC-Seminarraum 3, Kolingasse 14-16, OG02
Wednesday 11.05. 09:45 - 11:15 Seminarraum 10, Kolingasse 14-16, OG01
Wednesday 18.05. 09:45 - 11:15 Seminarraum 10, Kolingasse 14-16, OG01
Wednesday 25.05. 09:45 - 11:15 Seminarraum 10, Kolingasse 14-16, OG01
Wednesday 25.05. 11:30 - 13:00 Seminarraum 18 Kolingasse 14-16, OG02
Wednesday 01.06. 09:45 - 11:15 Seminarraum 10, Kolingasse 14-16, OG01
Wednesday 08.06. 09:45 - 11:15 Seminarraum 10, Kolingasse 14-16, OG01
Wednesday 15.06. 09:45 - 11:15 Seminarraum 10, Kolingasse 14-16, OG01
Wednesday 22.06. 09:45 - 11:15 Seminarraum 10, Kolingasse 14-16, OG01
Wednesday 29.06. 09:45 - 11:15 PC-Seminarraum 3, Kolingasse 14-16, OG02
Tuesday 19.07. 09:45 - 11:15 Seminarraum 11, Währinger Straße 29 2.OG

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

Regular points (100 in total):
- A midterm exam (90 minutes, written, closed-book, on-site) on May 4: 40 points.
- A final exam (90 minutes, written, closed-book, on-site) on June 29: 40 points.
- A short presentation (10-12 minutes): 20 points
Details:
* 15 points for the presentation itself, including slides
* 5 points for questions and feedback on fellow students' presentations

Bonus points:
- answering the received feedback questions on one's own presentation: 6 points
- active participation on Moodle forums: 10 points

Minimum requirements and assessment criteria

No prerequirements.
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

Association in the course directory

CO-INF3

Last modified: Sa 08.07.2023 00:21