Course details
Selected Chapters on Algorithms
Guarantor
Language of instruction
Czech, English
Completion
Examination
Time span
- 39 hrs lectures
Department
Study literature
- Cormen,T.H., Leiserson,C.E.,Rivest,R.L.: Introduction to Algorithms. MIT Press, Cambridge
Fundamental literature
- Cormen,T.H., Leiserson,C.E.,Rivest,R.L.: Introduction to Algorithms. MIT Press, Cambridge, Massachusetts, London, England 1990.
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
Course inclusion in study plans