052111 VU Advanced Algorithms (2021W)
Prüfungsimmanente Lehrveranstaltung
Labels
VOR-ORT
An/Abmeldung
Hinweis: Ihr Anmeldezeitpunkt innerhalb der Frist hat keine Auswirkungen auf die Platzvergabe (kein "first come, first served").
- Anmeldung von Mo 13.09.2021 09:00 bis Mo 20.09.2021 09:00
- Abmeldung bis Do 14.10.2021 23:59
Details
max. 25 Teilnehmer*innen
Sprache: Englisch
Lehrende
Termine (iCal) - nächster Termin ist mit N markiert
UPDATE on 19 November:
Due to the lockdown, we are going completely online until further notice.
Montag
04.10.
11:30 - 13:00
Seminarraum 7, Währinger Straße 29 1.OG
Dienstag
05.10.
15:00 - 16:30
Seminarraum 11, Währinger Straße 29 2.OG
Montag
11.10.
11:30 - 13:00
Seminarraum 7, Währinger Straße 29 1.OG
Dienstag
12.10.
15:00 - 16:30
Seminarraum 11, Währinger Straße 29 2.OG
Montag
18.10.
11:30 - 13:00
Seminarraum 7, Währinger Straße 29 1.OG
Dienstag
19.10.
15:00 - 16:30
Seminarraum 11, Währinger Straße 29 2.OG
Montag
25.10.
11:30 - 13:00
Seminarraum 7, Währinger Straße 29 1.OG
Montag
08.11.
11:30 - 13:00
Seminarraum 7, Währinger Straße 29 1.OG
Dienstag
09.11.
15:00 - 16:30
Seminarraum 11, Währinger Straße 29 2.OG
Montag
15.11.
11:30 - 13:00
Seminarraum 7, Währinger Straße 29 1.OG
Dienstag
16.11.
15:00 - 16:30
Seminarraum 11, Währinger Straße 29 2.OG
Montag
22.11.
11:30 - 13:00
Seminarraum 7, Währinger Straße 29 1.OG
Dienstag
23.11.
15:00 - 16:30
Seminarraum 11, Währinger Straße 29 2.OG
Montag
29.11.
11:30 - 13:00
Seminarraum 7, Währinger Straße 29 1.OG
Dienstag
30.11.
15:00 - 16:30
Seminarraum 11, Währinger Straße 29 2.OG
Montag
06.12.
11:30 - 13:00
Seminarraum 7, Währinger Straße 29 1.OG
Dienstag
07.12.
15:00 - 16:30
Seminarraum 11, Währinger Straße 29 2.OG
Montag
13.12.
11:30 - 13:00
Seminarraum 7, Währinger Straße 29 1.OG
Dienstag
14.12.
15:00 - 16:30
Seminarraum 11, Währinger Straße 29 2.OG
Montag
10.01.
11:30 - 13:00
Seminarraum 7, Währinger Straße 29 1.OG
Dienstag
11.01.
15:00 - 16:30
Seminarraum 11, Währinger Straße 29 2.OG
Montag
17.01.
11:30 - 13:00
Seminarraum 7, Währinger Straße 29 1.OG
Dienstag
18.01.
15:00 - 16:30
Seminarraum 11, Währinger Straße 29 2.OG
Montag
24.01.
11:30 - 13:00
Seminarraum 7, Währinger Straße 29 1.OG
Dienstag
25.01.
15:00 - 16:30
Seminarraum 11, Währinger Straße 29 2.OG
Montag
31.01.
11:30 - 13:00
Seminarraum 7, Währinger Straße 29 1.OG
Information
Ziele, Inhalte und Methode der Lehrveranstaltung
Art der Leistungskontrolle und erlaubte Hilfsmittel
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.
Mindestanforderungen und Beurteilungsmaßstab
percentage of points grade
>= 89% 1
>= 76% 2
>= 63% 3
>= 50% 4
< 50% 5
>= 89% 1
>= 76% 2
>= 63% 3
>= 50% 4
< 50% 5
Prüfungsstoff
Will be announced appropriately on Moodle.
Literatur
Will be announced on Moodle.
Zuordnung im Vorlesungsverzeichnis
Module: AAL
Letzte Änderung: Sa 20.11.2021 17:48
---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 algorithmsFRIENDLY 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)