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

052111 VU Advanced Algorithms (2021W)

6.00 ECTS (4.00 SWS), SPL 5 - Informatik und Wirtschaftsinformatik
Continuous assessment of course work
ON-SITE
Moodle

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 19 November:
Due to the lockdown, we are going completely online until further notice.

  • Monday 04.10. 11:30 - 13:00 Seminarraum 7, Währinger Straße 29 1.OG
  • Tuesday 05.10. 15:00 - 16:30 Seminarraum 11, Währinger Straße 29 2.OG
  • Monday 11.10. 11:30 - 13:00 Seminarraum 7, Währinger Straße 29 1.OG
  • Tuesday 12.10. 15:00 - 16:30 Seminarraum 11, Währinger Straße 29 2.OG
  • Monday 18.10. 11:30 - 13:00 Seminarraum 7, Währinger Straße 29 1.OG
  • Tuesday 19.10. 15:00 - 16:30 Seminarraum 11, Währinger Straße 29 2.OG
  • Monday 25.10. 11:30 - 13:00 Seminarraum 7, Währinger Straße 29 1.OG
  • Monday 08.11. 11:30 - 13:00 Seminarraum 7, Währinger Straße 29 1.OG
  • Tuesday 09.11. 15:00 - 16:30 Seminarraum 11, Währinger Straße 29 2.OG
  • Monday 15.11. 11:30 - 13:00 Seminarraum 7, Währinger Straße 29 1.OG
  • Tuesday 16.11. 15:00 - 16:30 Seminarraum 11, Währinger Straße 29 2.OG
  • Monday 22.11. 11:30 - 13:00 Seminarraum 7, Währinger Straße 29 1.OG
  • Tuesday 23.11. 15:00 - 16:30 Seminarraum 11, Währinger Straße 29 2.OG
  • Monday 29.11. 11:30 - 13:00 Seminarraum 7, Währinger Straße 29 1.OG
  • Tuesday 30.11. 15:00 - 16:30 Seminarraum 11, Währinger Straße 29 2.OG
  • Monday 06.12. 11:30 - 13:00 Seminarraum 7, Währinger Straße 29 1.OG
  • Tuesday 07.12. 15:00 - 16:30 Seminarraum 11, Währinger Straße 29 2.OG
  • Monday 13.12. 11:30 - 13:00 Seminarraum 7, Währinger Straße 29 1.OG
  • Tuesday 14.12. 15:00 - 16:30 Seminarraum 11, Währinger Straße 29 2.OG
  • Monday 10.01. 11:30 - 13:00 Seminarraum 7, Währinger Straße 29 1.OG
  • Tuesday 11.01. 15:00 - 16:30 Seminarraum 11, Währinger Straße 29 2.OG
  • Monday 17.01. 11:30 - 13:00 Seminarraum 7, Währinger Straße 29 1.OG
  • Tuesday 18.01. 15:00 - 16:30 Seminarraum 11, Währinger Straße 29 2.OG
  • Monday 24.01. 11:30 - 13:00 Seminarraum 7, Währinger Straße 29 1.OG
  • Tuesday 25.01. 15:00 - 16:30 Seminarraum 11, Währinger Straße 29 2.OG
  • Monday 31.01. 11:30 - 13:00 Seminarraum 7, Währinger Straße 29 1.OG

Information

Aims, contents and method of the course

Please see the admin details video: https://ucloud.univie.ac.at/index.php/s/EcMxILlcKhLdrAE

Contents
---Advanced data structures and amortized analysis (e.g., hashing)
---Randomized algorithms and probabilistic analysis
---Online algorithms and competitive analysis
---Data stream algorithms
---External memory algorithms and cache-oblivious algorithms
---Linear-algebra based algorithms
---Distributed algorithms

FRIENDLY WARNING: This is a mathematical course. You MUST ALREADY BE comfortable and familiar with mathematical proofs related to algorithms.

IMPORTANT: This advanced-algorithms course has the following prerequisites.
1) Discrete mathematics: a one semester course, equivalent to 051110 VO Mathematical Foundations of Computer Science 1 at University of Vienna covering the following topics. Set theory, functions and relations, combinatorics (counting), applications of pigeonhole principle, etc., several proofs using the principle of mathematical induction, graph theory, and linear algebra (Gaussian elimination, linear independence, subspaces, dimension, rank, etc.).

2) Data structures and algorithms: two one-semester courses, equivalent to 051024 VU Algorithms and Data Structures 1 and 052100 VU Algorithms and Data Structures 2 at University of Vienna covering the following topics. Big-O notation and asymptotic analysis; lists, stacks, and queues and their applications; trees and binary trees: tree traversals (inorder, preorder, postorder); graphs: adjacency list and adjacency matrix representations, depth-first search, breadth first-search, minimum spanning tree algorithms, etc.; searching and sorting algorithms; divide and conquer algorithms; greedy algorithms, dynamic programming, network flow, etc.

3) Probability: a one-semester course, equivalent to 051130 VO Einführende Statistik (2020W)

Assessment and permitted materials

4 homeworks and 4 quizzes (exams). Each worth between 10 and 15 points; in total, 100 points. Quizzes (exams) will be closed-book and closed-notes. No help is allowed during the quizzes (exams). What is allowed for the homeworks will be announced on Moodle. Needless to mention, you are not allowed to copy solutions from someone or from the Internet---neither for homeworks and nor for quizzes (exams). Doing so attracts disciplinary action.

Minimum requirements and assessment criteria

percentage of points grade
>= 89% 1
>= 76% 2
>= 63% 3
>= 50% 4
< 50% 5

Examination topics

Will be announced appropriately on Moodle.

Reading list

Will be announced on Moodle.

Association in the course directory

Module: AAL

Last modified: Sa 20.11.2021 17:48