052100 VU Algorithms and Data Structures 2 (2021S)
- Registration is open from Mo 15.02.2021 09:00 to Mo 22.02.2021 09:00
- Deregistration possible until Su 14.03.2021 23:59
Classes (iCal) - next class is marked with N
IMPORTANT: This is a second course on algorithms at University of Vienna, and hence 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, probability theory, and linear algebra
This quiz is COMPULSORY.Note the following:
This is a mathematical course, and we will be focusing on mathematical proofs. Appropriate level of mathematical background is assumed. The main aim is to develop mathematical intuition with respect to algorithm analysis by doing several mathematical proofs. At the end of the course, you should be able to not only recognize correct mathematical proofs but also be able to come up with your own mathematical proofs of correctness of an algorithm and its running time.
Hörsaal 2, Währinger Straße 29 2.OG
Hörsaal 3, Währinger Straße 29 3.OG
Seminarraum 10, Währinger Straße 29 2.OG
Aims, contents and method of the course
Assessment and permitted materials
Two homeworks, each worth 5 points
Either a final exam or a project depending on the pandemic situation, worth 30 points.
Bonus points: Compulsory prerequisites quiz, 2 points and class participation, 8 points.Exams/quizzes will be closed book, closed notes, and no resources/help from the Internet allowed.Further details will be added soon.
Minimum requirements and assessment criteria
>= 89% 1
>= 76% 2
>= 63% 3
>= 50% 4
< 50% 5