269016 VU Algorithms and Data Structures (2016S)
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 01.02.2016 08:00 to Tu 23.02.2016 23:00
- Deregistration possible until Su 20.03.2016 23:00
Details
max. 25 participants
Language: English
Lecturers
Classes (iCal) - next class is marked with N
On May 19, 2016, the class will take place in Seminarraum 5, instead of 6.
Thursday
03.03.
13:15 - 14:45
Seminarraum 6, Währinger Straße 29 1.OG
Thursday
10.03.
13:15 - 14:45
Seminarraum 6, Währinger Straße 29 1.OG
Thursday
17.03.
13:15 - 14:45
Seminarraum 6, Währinger Straße 29 1.OG
Thursday
07.04.
13:15 - 14:45
Seminarraum 6, Währinger Straße 29 1.OG
Thursday
14.04.
13:15 - 14:45
Seminarraum 6, Währinger Straße 29 1.OG
Thursday
21.04.
13:15 - 14:45
Seminarraum 6, Währinger Straße 29 1.OG
Thursday
28.04.
13:15 - 14:45
Seminarraum 6, Währinger Straße 29 1.OG
Thursday
12.05.
13:15 - 14:45
Seminarraum 6, Währinger Straße 29 1.OG
Thursday
19.05.
13:15 - 14:45
Seminarraum 6, Währinger Straße 29 1.OG
Thursday
02.06.
13:15 - 14:45
Seminarraum 6, Währinger Straße 29 1.OG
Thursday
09.06.
13:15 - 14:45
Seminarraum 6, Währinger Straße 29 1.OG
Thursday
16.06.
13:15 - 14:45
Seminarraum 6, Währinger Straße 29 1.OG
Thursday
23.06.
13:15 - 14:45
Seminarraum 6, Währinger Straße 29 1.OG
Thursday
30.06.
13:15 - 14:45
Seminarraum 6, Währinger Straße 29 1.OG
Information
Aims, contents and method of the course
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.
Assessment and permitted materials
The will be two exams, one in the middle of the semester (exact date will be announced) and one in the last class of the semester, each with a maximum of 40 points. You will be able to earn up to 30 points via exercise sheets (homework) and up to 10 points for a presentation. No materials are permitted in the exams.
Minimum requirements and assessment criteria
No requirements.
Assessment criteria:
1) Knowledge of the content of the course
2) Basic skills to design and theoretically analyze algorithms and data structures
Assessment criteria:
1) Knowledge of the content of the course
2) Basic skills to design and theoretically analyze algorithms and data structures
Examination topics
lectures and exercises
Reading list
"Algorithms Design" by Kleinberg and Tardow
"Introduction to Algorithms" by Cormen Leiseron, Rivest, and Stein
"Introduction to Algorithms" by Cormen Leiseron, Rivest, and Stein
Association in the course directory
CO-INF3
Last modified: Sa 08.07.2023 00:21