Warning! The directory is not yet complete and will be amended until the beginning of the term.
052100 VU Algorithms and Data Structures 2 (2024S)
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 12.02.2024 09:00 to Th 22.02.2024 09:00
- Deregistration possible until Th 14.03.2024 23:59
Details
max. 50 participants
Language: English
Lecturers
Classes (iCal) - next class is marked with N
- Monday 04.03. 09:45 - 11:15 Digital
- Monday 11.03. 09:45 - 11:15 Hörsaal 2, Währinger Straße 29 2.OG
- Monday 18.03. 09:45 - 11:15 Hörsaal 2, Währinger Straße 29 2.OG
- Monday 08.04. 09:45 - 11:15 Hörsaal 2, Währinger Straße 29 2.OG
- Monday 15.04. 09:45 - 11:15 Hörsaal 2, Währinger Straße 29 2.OG
- Monday 22.04. 09:45 - 11:15 Hörsaal 2, Währinger Straße 29 2.OG
- Monday 29.04. 09:45 - 11:15 Hörsaal 2, Währinger Straße 29 2.OG
- Monday 06.05. 09:45 - 11:15 Hörsaal 2, Währinger Straße 29 2.OG
- Monday 13.05. 09:45 - 11:15 Hörsaal 2, Währinger Straße 29 2.OG
- Monday 27.05. 09:45 - 11:15 Hörsaal 2, Währinger Straße 29 2.OG
- Monday 03.06. 09:45 - 11:15 Digital
- Monday 10.06. 09:45 - 11:15 Hörsaal 2, Währinger Straße 29 2.OG
- Monday 17.06. 09:45 - 11:15 Hörsaal 2, Währinger Straße 29 2.OG
-
Monday
24.06.
09:45 - 11:15
Hörsaal 2, Währinger Straße 29 2.OG
Seminarraum 2, Währinger Straße 29 1.UG
Seminarraum 8, Währinger Straße 29 1.OG
Information
Aims, contents and method of the course
Assessment and permitted materials
Students can collect up to 100 regular points as follows:
- 2 online multiple choice quizzes (up to 10 points each)
- 2 homework sheets (up to 15 points each)
- 10 questions of the day (up to 10 points)
- written exam (up to 40 points)In addition, up to 20 bonus points can be collected as follows:
- attending >= 11 classes (up to 5 points)
- prerequisites quiz (up to 5 points)
- solving bonus problems on homework sheets (up to 10 points)Exams/quizzes are closed-book, no resources/help from the Internet are allowed.
- 2 online multiple choice quizzes (up to 10 points each)
- 2 homework sheets (up to 15 points each)
- 10 questions of the day (up to 10 points)
- written exam (up to 40 points)In addition, up to 20 bonus points can be collected as follows:
- attending >= 11 classes (up to 5 points)
- prerequisites quiz (up to 5 points)
- solving bonus problems on homework sheets (up to 10 points)Exams/quizzes are closed-book, no resources/help from the Internet are allowed.
Minimum requirements and assessment criteria
If P is the sum of regular and bonus points received, your grade will be:1, if P >= 89,
2, if P >= 76,
3, if P >= 63,
4, if P >= 50,
5, otherwise.Presence is mandatory for the first lecture. Otherwise, it is not a requirement, but strongly recommended.
There is no minimum required number of points per exam/homework sheet/quiz.
2, if P >= 76,
3, if P >= 63,
4, if P >= 50,
5, otherwise.Presence is mandatory for the first lecture. Otherwise, it is not a requirement, but strongly recommended.
There is no minimum required number of points per exam/homework sheet/quiz.
Examination topics
Everything covered in the lecture, the reading material, the homework problems, and the quizzes.
Reading list
- Cormen, Thomas H.; Leiserson, Charles E.; Rivest, Ronald L.; Stein, Clifford. Introduction to Algorithms. MIT Press, 2009/2022 (3rd & 4th edition).
- Kleinberg, Jon; Tardos, Éva. Algorithm Design. Pearson, 2006.
- Erickson, Jeff. Algorithms. Online resource: http://algorithms.wtf/Further literature will be provided via Moodle.
- Kleinberg, Jon; Tardos, Éva. Algorithm Design. Pearson, 2006.
- Erickson, Jeff. Algorithms. Online resource: http://algorithms.wtf/Further literature will be provided via Moodle.
Association in the course directory
Module: CNA
Last modified: We 22.05.2024 10:45
- Discrete Mathematics – equivalent to 051110 VO Mathematical Foundations of Computer Science 1
- Introduction to Algorithms and Data Structures – equivalent to 051024 VU Algorithms and Data Structures 1Topics:* Proof Techniques* Algorithmic Strategies:
- Dynamic Programming
- Greedy Algorithms* Data Structures and Algorithms
- Maximum Flow
- Shortest Paths
- Hashing