|
Lecturer(s)
|
-
Fišer Jiří, Mgr. Ph.D.
-
Sýkorová Květuše, Mgr.
|
|
Course content
|
1. Basic date structures - array, stack, front, list. 2. Algorithms and his properties description. 3. Basic types of sorting algorithms. 4. Searching algorithms. 5. Open and close hash tables, hash functions. 6. Sparse and dense indices. 7. Tree structures - binary, digital, trie, balanced. 8. Graphs - depth and width searching.
|
|
Learning activities and teaching methods
|
|
unspecified
|
|
Learning outcomes
|
Aim of this course is to gain the knowledge of basic abstract data structures (from arrays to searching-tree structures) and of course algorithms used over these structures. Importance is set not only to formal description of structures but also to practical implementation.
|
|
Prerequisites
|
unspecified
|
|
Assessment methods and criteria
|
unspecified
|
|
Recommended literature
|
-
Sedgewick R. Algoritmy v C. SoftPress, Praha, 2003.
-
Wirth N. "Algorithms + Data Structures = Programs". Prentice-Hall, 1975.
-
Wirth N. "Algoritmy a štruktúry údajov". Alfa, Bratislava, 1989.
-
Wróblewski, P. Algoritmy, datové struktury a programovací techniky. ComputerPress, Brno, 2004.
|