|
Lecturer(s)
|
-
Škrabal Radomír, Mgr.
-
Osička Petr, Mgr. Ph.D.
-
Večerka Arnošt, RNDr.
-
Kühr Tomáš, Mgr. Ph.D.
|
|
Course content
|
Searching problem, types of searching algorithms. Searching in linear data structures: sequential search in an array or list of randomly ordered items, binary search in a sorted array. Binary search trees, search operation, AVL-trees, insertion of item into an AVL-tree, deletion of item from an AVL-tree. Balanced trees, their structure, search operation, insertion, and deletion of items in balanced trees. 2-3-4 trees, red-black trees, operations on these trees. Hashing, computation of hash function, hash table organization, methods for conflict resolution: open addressing, separate chaining.
|
|
Learning activities and teaching methods
|
|
Lecture, Demonstration
|
|
Learning outcomes
|
The students become familiar with advanced concepts of of algorithm design.
2. Comprehension. Understand advanced concepts of algorithm design.
|
|
Prerequisites
|
unspecified
|
|
Assessment methods and criteria
|
Oral exam, Written exam
Active participation in class. Completion of assigned homeworks. Passing the oral (or written) exam.
|
|
Recommended literature
|
-
Aho, A.V., Hopcroft, J.E., Ullman, J.D. (1983). Data Structures and Algorithms. Addison-Wesley.
-
Bhargava, A. Y. (2016). Algorithms.. Manning Publications Co.
-
CORMEN, T. H., LEISERSON C. E., RIVEST D. L., STEIN C. (2001). Introduction to Algorithms, Second Edition. MIT Press.
-
KNUTH, D. (2005). The Art of Computer Programming, Volume 3, Sorting and Searching, Second Edition. Addison-Wesley.
-
Manber U. (1989). Introduction to Algorithms. A creative approach.. Addison-Wesley.
-
Sedgewick, R. (2002). Algorithms in C++ Part 5: Graph Algorithms (3rd Edition). Addison-Wesley Professional.
-
Skiena, S.S. (2012). The Algorithm Design Manual. Springer-Verlag.
|