Algorithms and Data Structures 1 AI
|Course||Algorithms and Data Structures 1 AI|
Trendafilov (UE G1, UE G2, UE G3, UE G4, UE G5, UE G6, UE G7)
Gruenberger (UE G8)
340.210 (UE G1)
340.211 (UE G2)
340.212 (UE G3)
340.213 (UE G4)
340.214 (UE G5)
340.215 (UE G6)
340.216 (UE G7)
340.217 (UE G8)
1 (UE G1, UE G2, UE G3, UE G4, UE G5, UE G6, UE G7, UE G8)
|Target audience||Students of Artificial Intelligence in the second term|
|Objectives||Students are able to think algorithmically. They
know the basic static and dynamic data structures, the most important
sorting and search algorithms, and the concepts of recursion and random
numbers. Furthermore, they are able to analyze the complexity of
algorithms with respect to runtime and memory requirements.
In the exercise, students apply the topics presented in the lecture in practice by designing and implementing algorithms in Python.
|Criteria for evaluation||VL: Exam at the end of term.
UE: Assessment of weekly assignments.
|Study material||All material will be available in the course section in Moodle. Additional literature will be announced in the course.|