Course details
Selected Chapters on Algorithms
VKA Acad. year 2003/2004 Summer semester
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.
Guarantor
Language of instruction
Completion
Time span
- 39 hrs lectures
Department
Learning objectives
To command the behaviour of the advanced algorithms and data structures. To be acquainted with their fatures, conplexity and applications.
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.