|
|
|
||
Last update: doc. RNDr. Pavel Töpfer, CSc. (14.01.2019)
|
|
||
Last update: doc. RNDr. Pavel Töpfer, CSc. (14.01.2019)
The course should provide a student with a deeper understanding of data structures and their behaviour on real computers. |
|
||
Last update: doc. RNDr. Pavel Töpfer, CSc. (14.01.2019)
One has to get a passing grade from the tutorials before comming for an exam. To get a passing grade from the tutorials one has to earn sufficient amount of points from the homeworks. Due to the specifics of the homeworks no make-ups are possible. |
|
||
Last update: T_KTI (26.04.2016)
D. P. Mehta, S. Sahni eds.: Handbook of Data Structures and Applications. Chapman & Hall/CRC, Computer and Information Series, 2005
K. Mehlhorn: Data Structures and Algorithms I: Sorting and Searching. Springer-Verlag, Berlin, 1984
|
|
||
Last update: doc. RNDr. Pavel Töpfer, CSc. (14.01.2019)
Knowledge and understanding of the material covered during the class. |
|
||
Last update: doc. RNDr. Pavel Töpfer, CSc. (01.02.2019)
Trees (a,b)-trees Splay trees BB-α trees Hashing Choice of hash functions: universal hash functions, k-indepenence Linear probing Cuckoo hashing Bloom filter Text data structures Suffix tree Suffix array Techniques for memory hierarchy Parallel data structures Multidimensional data structures K-d trees Range trees
Warning: The course is offered in English only in the summer term and in Czech only in the winter term. |
|
||
Last update: RNDr. Jiří Fink, Ph.D. (20.09.2022)
Knowledge on the level of the undergraduate Algorithms and data structures.
Notice that Czech lectures and tutorials are in winter semesters while English lectures and tutorials are in summer semesters only. |