Universität Wien

051946 VU Algorithms and Data Structures (2024S)

3.00 ECTS (2.00 SWS), SPL 5 - Informatik und Wirtschaftsinformatik
Continuous assessment of course work
Moodle
Mo 06.05. 13:15-14:45 Seminarraum 7, Währinger Straße 29 1.OG

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. 20 participants
Language: German

Lecturers

Classes (iCal) - next class is marked with N

Next lecture, on 08.04.2024 is online on Zoom! Details on Moodle.

Monday 04.03. 13:15 - 14:45 Seminarraum 7, Währinger Straße 29 1.OG
Monday 11.03. 13:15 - 14:45 Seminarraum 7, Währinger Straße 29 1.OG
Monday 18.03. 13:15 - 14:45 Seminarraum 7, Währinger Straße 29 1.OG
Monday 08.04. 13:15 - 14:45 Seminarraum 7, Währinger Straße 29 1.OG
Monday 15.04. 13:15 - 14:45 Seminarraum 7, Währinger Straße 29 1.OG
Monday 22.04. 13:15 - 14:45 Seminarraum 7, Währinger Straße 29 1.OG
Monday 29.04. 13:15 - 14:45 Seminarraum 7, Währinger Straße 29 1.OG
Monday 13.05. 13:15 - 14:45 Seminarraum 7, Währinger Straße 29 1.OG
Monday 27.05. 13:15 - 14:45 Seminarraum 7, Währinger Straße 29 1.OG
Monday 03.06. 13:15 - 14:45 Seminarraum 7, Währinger Straße 29 1.OG
Monday 10.06. 13:15 - 14:45 Seminarraum 7, Währinger Straße 29 1.OG
Monday 17.06. 13:15 - 14:45 Seminarraum 7, Währinger Straße 29 1.OG
Monday 24.06. 13:15 - 14:45 Seminarraum 7, Währinger Straße 29 1.OG
Monday 01.07. 11:30 - 14:45 Seminarraum 7, Währinger Straße 29 1.OG

Information

Aims, contents and method of the course

Important note: The first lecture on March 4 is a Vorbesprechung, and attendance is mandatory.

This is a first course in data structures and algorithms. There is a strong prerequisite of programming experience. As the name suggests, we will look at some algorithms, and if you are not comfortable with programming, you will have a hard time following the algorithms. Currently the list of tentative topics is as follows:
-- Computational and memory model and pseudocode conventions
-- Insertion and merge sort
-- Growth of functions
-- Dynamic arrays, stacks, queues, linked lists, and binary trees
-- Depth first search, breadth first search, and Dijkstra's algorithm
-- Proving correctness of algorithms using the principle of mathematical induction

Assessment and permitted materials

Details will be on Moodle, but tentatively, several homeworks, a midterm exam, and a final exam worth half the total points.

Minimum requirements and assessment criteria

Examination topics

Wird im Moodlekurs bekannt gegeben

Reading list

Introduction to Algorithms, Third Edition by Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest and Clifford Stein. Also available in German.

Association in the course directory

Modul: UF-INF-04

Last modified: We 20.03.2024 16:05