Přístupnostní navigace
E-application
Search Search Close
Course detail
FIT-IALeAcad. year: 2024/2025
Overview of fundamental data structures and their exploitation. Principles of dynamic memory allocation. Specification of abstract data types (ADT). Specification and implementation of ADT's: lists, stack and its exploitation, queue, searching table. Algorithms upon the binary trees. Searching: sequential, in the ordered and in not ordered array, searching with the guard (sentinel), binary search, search tree, balanced trees (AVL). Searching in hash-tables. Sorting (ordering), principles, sorting without the moving of items, sorting with multiple keys. Most common methods of sorting: Select-sort, Bubble-sort, Heap-sort, Insert-sort a jeho varianty, Shell-sort, recursive and non-recursive notation of the Quick sort, Merge-sort, List-merge-sort, Radix-sort.
Language of instruction
Number of ECTS credits
Mode of study
Guarantor
Department
Offered to foreign students
Entry knowledge
Rules for evaluation and completion of the course
Aims
Study aids
Prerequisites and corequisites
Basic literature
Recommended literature
Classification of course in study plans
specialization BCH , 0 year of study, summer semester, recommended course
Lecture
Teacher / Lecturer
Syllabus
Project