#### Data Structures and Algorithms (FH Joanneum/Campus02) - Instructor

**Content**

– Introduction and basics

– Elementary data structures: lists, stack, queue, heap

– asymptotic runtime analyses: O, theta and omega notation

– Basic Algorithmic Principles: recursion, divide and conquer, backtracking

– Sorting: Insert, Quicksort, Mergesort, Heapsort, Radixsort,…

– Hashing

– Search: sequential, binary, interpolative, quadratic binary search

– Tree structures: definition and basics, binary trees, (a-b)-trees, amortized restructuring costs, balanced search trees