269016 VU Algorithms and Data Structures (2021S)
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 01.02.2021 08:00 bis Mo 22.02.2021 07:00
- Abmeldung bis Fr 26.03.2021 23:59
Details
max. 25 Teilnehmer*innen
Sprache: Englisch
Lehrende
Termine (iCal) - nächster Termin ist mit N markiert
Mittwoch
03.03.
09:45 - 11:15
Digital
Mittwoch
10.03.
09:45 - 11:15
Digital
Mittwoch
17.03.
09:45 - 11:15
Digital
Mittwoch
24.03.
09:45 - 11:15
Digital
Mittwoch
14.04.
09:45 - 11:15
Digital
Mittwoch
21.04.
09:45 - 11:15
Digital
Mittwoch
28.04.
09:45 - 11:15
Digital
Mittwoch
05.05.
09:45 - 11:15
Digital
Mittwoch
12.05.
09:45 - 11:15
Digital
Mittwoch
19.05.
09:45 - 11:15
Digital
Mittwoch
26.05.
09:45 - 11:15
Digital
Mittwoch
02.06.
09:45 - 11:15
Digital
Mittwoch
09.06.
09:45 - 11:15
Digital
Mittwoch
16.06.
09:45 - 11:15
Digital
Mittwoch
23.06.
09:45 - 11:15
Digital
Mittwoch
30.06.
09:45 - 11:15
Digital
Information
Ziele, Inhalte und Methode der Lehrveranstaltung
The lecture gives an introduction to algorithms and data structures. Topics covered in the lecture are: Complexity and Worst Case Analysis, Lists, Queues, and Stacks, Heaps, Balanced Search Trees, Dynamic Programming, Hash Functions, Divide and Conquer, Sorting Algorithms, Graph Algorithms, LP and ILP, Approximation Algorithms and Greedy Algorithms.
Art der Leistungskontrolle und erlaubte Hilfsmittel
- An exam (written or oral) at the end of the semester, which gives up to 50 points. No materials are allowed.
- 3 written quizzes or assignments on Moodle, which give up to 25 points in total. Using the lecture slides is allowed.
- A short presentation (10-15min), which gives up to 25 points in total:
* 20 points for selection of the topic, slides, the presentation itself, and answering questions
* 5 points for questions and feedback on fellow students' presentationsWritten tests may be checked for plagiarism (Turnitin) and oral inquieries on the topic of the test may be made during the evaluation period of four weeks.Up to 10 bonus points will be awarded for active participation on Moodle forums.
- 3 written quizzes or assignments on Moodle, which give up to 25 points in total. Using the lecture slides is allowed.
- A short presentation (10-15min), which gives up to 25 points in total:
* 20 points for selection of the topic, slides, the presentation itself, and answering questions
* 5 points for questions and feedback on fellow students' presentationsWritten tests may be checked for plagiarism (Turnitin) and oral inquieries on the topic of the test may be made during the evaluation period of four weeks.Up to 10 bonus points will be awarded for active participation on Moodle forums.
Mindestanforderungen und Beurteilungsmaßstab
No prerequirements.
Assessment criteria:
Percentage of points grade
>= 89% 1
>= 76% 2
>= 63% 3
>= 50% 4
< 50% 5
Assessment criteria:
Percentage of points grade
>= 89% 1
>= 76% 2
>= 63% 3
>= 50% 4
< 50% 5
Prüfungsstoff
Everything covered in the lectures, the homework problems, the slides, and the reading and supplementary material provided on Moodle.
Literatur
"Introduction to Algorithms" by Cormen Leiseron, Rivest, and Stein
"Algorithms Design" by Kleinberg and Tardos
"Algorithms Design" by Kleinberg and Tardos
Zuordnung im Vorlesungsverzeichnis
CO-INF3
Letzte Änderung: Sa 08.07.2023 00:21