051946 VU Algorithmen und Datenstrukturen (2024S)

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