Přístupnostní navigace
E-application
Search Search Close
Course detail
FIT-IALAcad. year: 2024/2025
Overview of fundamental data structures and their exploitation. Introduction to time complexity of algorithms. 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), balanced multiway serach trees. Searching in hash-tables. Ordering (sorting), principles, sorting without the moving of items, sorting with multiple keys. Most common methods of sorting: Select-sort, Bubble-sort, Heap-sort, Insert-sort and its variants, Shell-sort, recursive and non-recursive notation of the Quick sort, Merge-sort, Radix-sort. Recursion and dynamic programming. Searching the patterns in the text. Graph algorithms. Proving of the correctness of programs.
5 ECTS credits represent approximately 125-150 hours of study workload:
Language of instruction
Number of ECTS credits
Mode of study
Guarantor
Department
Entry knowledge
Rules for evaluation and completion of the course
In case of illness or another serious obstacle, the student should inform the faculty about that and subsequently provide the evidence of such an obstacle. Then, it can be taken into account within evaluation:
Aims
The student will learn the fundamentals of algorithm complexity and will be able to use gained knowledge in the design of programs. Student acquaints with basic abstract data types and learn how to implement nad use them. The student learns and commands recursive and non-recursive notation of basic algorithms and will be able to use gained knowledge in the design of programmes. Student understands the implementation and analysis of most of the used algorithms for searching and sorting. The student will understand basic text search algorithms and basic graph algorithms. The student will learn about recursive problem solving and the basics of dynamic programming. The student will learn the principles of methods of proving of the correctness of programs and will be able to use gained knowledge in the design of programmes.
Study aids
Prerequisites and corequisites
Basic literature
Recommended reading
Elearning
Classification of course in study plans
specialization AUDB-TECH , 0 year of study, winter semester, electivespecialization AUDB-ZVUK , 0 year of study, winter semester, elective
Lecture
Teacher / Lecturer
Syllabus
Project