Universität Wien

269016 VU Algorithms and Data Structures (2019S)

3.00 ECTS (2.00 SWS), SPL 26 - Physik
Continuous assessment of course work
Moodle

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).

Details

max. 25 participants
Language: English

Lecturers

Classes (iCal) - next class is marked with N

  • Thursday 07.03. 13:15 - 14:45 Seminarraum 6, Währinger Straße 29 1.OG
  • Thursday 14.03. 13:15 - 14:45 Seminarraum 6, Währinger Straße 29 1.OG
  • Thursday 21.03. 13:15 - 14:45 Seminarraum 6, Währinger Straße 29 1.OG
  • Thursday 28.03. 13:15 - 14:45 Seminarraum 6, Währinger Straße 29 1.OG
  • Thursday 04.04. 13:15 - 14:45 Seminarraum 6, Währinger Straße 29 1.OG
  • Thursday 11.04. 13:15 - 14:45 Seminarraum 6, Währinger Straße 29 1.OG
  • Thursday 02.05. 13:15 - 14:45 Seminarraum 6, Währinger Straße 29 1.OG
  • Thursday 09.05. 13:15 - 14:45 Seminarraum 6, Währinger Straße 29 1.OG
  • Thursday 16.05. 13:15 - 14:45 Seminarraum 6, Währinger Straße 29 1.OG
  • Thursday 23.05. 13:15 - 14:45 Seminarraum 6, Währinger Straße 29 1.OG
  • Thursday 06.06. 13:15 - 14:45 Seminarraum 6, Währinger Straße 29 1.OG
  • Thursday 13.06. 13:15 - 14:45 Seminarraum 6, Währinger Straße 29 1.OG
  • Thursday 27.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

There 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 as well as a presentation. Each exam gives 40 points, the presentation gives 20 points. 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

Examination topics

lectures and exercises

Reading list

"Algorithms Design" by Kleinberg and Tardos
"Introduction to Algorithms" by Cormen Leiseron, Rivest, and Stein

Association in the course directory

CO-INF3

Last modified: Sa 08.07.2023 00:21