262014 VU Algorithms and Data Structures for Computational Science (2025S)
Prüfungsimmanente Lehrveranstaltung
Labels
An/Abmeldung
Hinweis: Ihr Anmeldezeitpunkt innerhalb der Frist hat keine Auswirkungen auf die Platzvergabe (kein "first come, first served").
- Anmeldung von Mo 03.02.2025 08:00 bis Mo 24.02.2025 23:59
- Abmeldung bis Fr 21.03.2025 23:59
Details
max. 25 Teilnehmer*innen
Sprache: Englisch
Lehrende
Termine (iCal) - nächster Termin ist mit N markiert
As announced by the SPL, the course will only start on **March 11**.
- Dienstag 04.03. 15:00 - 16:30 Seminarraum 9, Kolingasse 14-16, OG01
- Donnerstag 06.03. 15:00 - 16:30 Seminarraum 9, Kolingasse 14-16, OG01
- Dienstag 11.03. 15:00 - 16:30 Seminarraum 9, Kolingasse 14-16, OG01
- Donnerstag 13.03. 15:00 - 16:30 Seminarraum 9, Kolingasse 14-16, OG01
- Dienstag 18.03. 15:00 - 16:30 Seminarraum 9, Kolingasse 14-16, OG01
- Donnerstag 20.03. 15:00 - 16:30 Seminarraum 9, Kolingasse 14-16, OG01
- Dienstag 25.03. 15:00 - 16:30 Seminarraum 9, Kolingasse 14-16, OG01
- Donnerstag 27.03. 15:00 - 16:30 Seminarraum 9, Kolingasse 14-16, OG01
- Dienstag 01.04. 15:00 - 16:30 Seminarraum 9, Kolingasse 14-16, OG01
- Donnerstag 03.04. 15:00 - 16:30 Seminarraum 9, Kolingasse 14-16, OG01
- Dienstag 08.04. 15:00 - 16:30 Seminarraum 9, Kolingasse 14-16, OG01
- Donnerstag 10.04. 15:00 - 16:30 PC-Seminarraum 1, Kolingasse 14-16, OG01
- N Dienstag 29.04. 15:00 - 16:30 Seminarraum 9, Kolingasse 14-16, OG01
- Dienstag 06.05. 15:00 - 16:30 Seminarraum 9, Kolingasse 14-16, OG01
- Donnerstag 08.05. 15:00 - 16:30 Seminarraum 9, Kolingasse 14-16, OG01
- Dienstag 13.05. 15:00 - 16:30 Seminarraum 9, Kolingasse 14-16, OG01
- Donnerstag 15.05. 15:00 - 16:30 Seminarraum 9, Kolingasse 14-16, OG01
- Dienstag 20.05. 15:00 - 16:30 Seminarraum 9, Kolingasse 14-16, OG01
- Donnerstag 22.05. 15:00 - 16:30 Seminarraum 9, Kolingasse 14-16, OG01
- Dienstag 27.05. 15:00 - 16:30 Seminarraum 9, Kolingasse 14-16, OG01
- Dienstag 03.06. 15:00 - 16:30 Seminarraum 9, Kolingasse 14-16, OG01
- Donnerstag 05.06. 15:00 - 16:30 Seminarraum 9, Kolingasse 14-16, OG01
- Dienstag 10.06. 15:00 - 16:30 Seminarraum 9, Kolingasse 14-16, OG01
- Donnerstag 12.06. 15:00 - 16:30 Seminarraum 9, Kolingasse 14-16, OG01
- Dienstag 17.06. 15:00 - 16:30 Seminarraum 9, Kolingasse 14-16, OG01
- Dienstag 24.06. 15:00 - 16:30 Seminarraum 9, Kolingasse 14-16, OG01
- Donnerstag 26.06. 15:00 - 16:30 Seminarraum 9, Kolingasse 14-16, OG01
Information
Ziele, Inhalte und Methode der Lehrveranstaltung
Art der Leistungskontrolle und erlaubte Hilfsmittel
A total of 100 regular points (100%) can be reached as follows:- 2 written exams (midterm/final, 90 minutes): 40 points each
- 4 homework sheets during the semester: 5 points eachAt least two problems on each homework sheet need to be solved and the solution handed in. Every student needs to present a solution to a homework problem once during the semester, selected by a random process. In this case, the presentation is graded with up to 5 points. For all other homework sheets, one random problem of those handed in is graded with up to 5 points.No materials are allowed for the written exams.Up to 25 bonus points can be reached:
- 5 bonus points if you miss at most 2 classes (-1 for every further missed class)
- up to 8 bonus points for solving bonus problems on homework sheets
- up to 12 bonus points (4x3 points) for solving more than the minimum of two problems per homework sheet.*Preliminary* dates for the exams:
midterm exam: April 10
final exam: June 24
- 4 homework sheets during the semester: 5 points eachAt least two problems on each homework sheet need to be solved and the solution handed in. Every student needs to present a solution to a homework problem once during the semester, selected by a random process. In this case, the presentation is graded with up to 5 points. For all other homework sheets, one random problem of those handed in is graded with up to 5 points.No materials are allowed for the written exams.Up to 25 bonus points can be reached:
- 5 bonus points if you miss at most 2 classes (-1 for every further missed class)
- up to 8 bonus points for solving bonus problems on homework sheets
- up to 12 bonus points (4x3 points) for solving more than the minimum of two problems per homework sheet.*Preliminary* dates for the exams:
midterm exam: April 10
final exam: June 24
Mindestanforderungen und Beurteilungsmaßstab
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.
If you fail to show up for an exam, you will receive 0 points for this exam.Homework sheets must be submitted before the deadline to be eligible for presentation in class. You can indicate for each problem on a homework sheet whether you would be willing to present it. The presenter for each problem is chosen by the instructors among all those that are willing to present, with ties broken randomly. There will be enough problems so that each student can present twice if everyone is willing to present all problems. If you fail to submit a homework sheet or are not chosen for presentation because you were unwilling to present many of the subproblems or are chosen to present but don't show up, you will receive 0 points.
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.
If you fail to show up for an exam, you will receive 0 points for this exam.Homework sheets must be submitted before the deadline to be eligible for presentation in class. You can indicate for each problem on a homework sheet whether you would be willing to present it. The presenter for each problem is chosen by the instructors among all those that are willing to present, with ties broken randomly. There will be enough problems so that each student can present twice if everyone is willing to present all problems. If you fail to submit a homework sheet or are not chosen for presentation because you were unwilling to present many of the subproblems or are chosen to present but don't show up, you will receive 0 points.
Prüfungsstoff
- all material presented and discussed in class
- contents and discussion of all exercise sheets
- reading material as provided on Moodle
- contents and discussion of all exercise sheets
- reading material as provided on Moodle
Literatur
Literature will be announced in class and (as far as possible) made available on Moodle.
Zuordnung im Vorlesungsverzeichnis
PM-ADS
Letzte Änderung: Do 10.04.2025 11:06
- design and analysis of algorithms especially for graph and clustering problems
- efficient exact and approximation algorithms for optimization problems (greedy algorithms, Linear Programming)
- algorithms for big data (online algorithms, streaming algorithms, external memory algorithms)On successful completion of this course, you will be familiar with the above concepts and methods and able to use them on your own in practice.The schedule consists of interactive lectures as well as homework presentations and discussions.Students are expected to have acquired basic knowledge in algorithms and data structures, e.g. 051024 VU Algorithms and Data Structures 1, prior to taking this course. See also the Extension Curriculum Basic Knowledge in Computational Sciences.If you are unsure whether you meet these prerequirements, please contact the lecturer(s).