Course detail
Selected Chapters on Algorithms
FIT-VKDAcad. year: 2017/2018
The subject is pointed to advances methods of analysis techniques in areas of dynamic programming, advanced data structures like B-Trees, Binomial Trees and Heaps, Fibonacci Heaps, Red-Black Trees, Skip-Lists, Splay Trees.
Language of instruction
Mode of study
Guarantor
Department
Learning outcomes of the course unit
- Student shows the creative capabilities in edvanced algoritmhs on the doctoral level in project like woek
- Student shows high quality presentation of the results of the project assigned
Prerequisites
- Knowledge of the algorithmization on the master degree level
Co-requisites
Planned learning activities and teaching methods
Assesment methods and criteria linked to learning outcomes
Passing the presentation of the project assigned
Course curriculum
- Syllabus of lectures:
- Recursion: The substitution method, the iteration method, the master method, proof of the master method
- Counting and probability
- Dynamic programming
- Greedy algorithms
- Medians and Order Statistics
- Red-Black Trees
- Splay Tree
- Skip-Lists
- B-Trees
- Binomial Tree
- Binomial Heap
- Fibonacci Heap
- Polynomial and FFT
Work placements
Aims
Specification of controlled education, way of implementation and compensation for absences
Recommended optional programme components
Prerequisites and corequisites
Basic literature
Recommended reading