Students learn algorithmic thinking. They are able to apply the topics presented in the lecture in practice by designing and implementing algorithms in Python.
Subject
Topics are:
Complexity
Lists/Stacks/Queues
Recursion
Backtracking
Trees
Heaps, Priority Queue
Sorting
Digital Sorting
Strings and Patterns
Random Numbers
Randomized Algorithms
Criteria for evaluation
Assessment of weekly assignments.
Methods
The content of the lecture is deepened by weekly assignments.
Language
English
Study material
All material will be available in the course section in Moodle.
Additional literature will be announced in the course.
