Algorithms and Data Structures 1-AIN-210
Introduction to problems. Matematical foundations: symbolism, combinatorial identities. Sorting analysis: heapsort, quicksort; linear time sorting. Data structures: basic, hash tables, bináry searching trees, red-black and balanced trees. Design and analysis technics: dynamic programming, greedy algorithms.
Offered in these study programs: Obligatory in Bachelor program in Applied Informatics