Title:

Selected Chapters on Algorithms

Code:VKA
Ac.Year:2004/2005
Term:Summer
Study plans:
ProgramBranchYearDuty
IT-PHD-3DIT3-Elective
Language:Czech
Private info:http://www.fit.vutbr.cz/study/courses/VKA/private/
Completion:examination (verbal)
Type of
instruction:
Hour/semLecturesSem. ExercisesLab. exercisesComp. exercisesOther
Hours:390000
 ExaminationTestsExercisesLaboratoriesOther
Points:00000
Guarantee:Honzík Jan M., prof. Ing., CSc., DIFS
Lecturer:Honzík Jan M., prof. Ing., CSc., DIFS
Faculty:Faculty of Information Technology BUT
Department:Department of Information Systems FIT BUT
 
Learning objectives:
To command the behaviour of the advanced algorithms and data structures. To be acquainted with their fatures, conplexity and applications.
Description:
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.
Syllabus of lectures:
  1. Recursion: The substitution method, the iteration method, the master method, proof of the master method
  2. Counting and probability
  3. Dynamic programming
  4. Greedy algorithms
  5. Medians and Order Statistics
  6. Red-Black Trees
  7. Splay Tree
  8. Skip-Lists
  9. B-Trees
  10. Binomial Tree
  11. Binomial Heap
  12. Fibonacci Heap
  13. Polynomial and FFT
Fundamental literature:
Cormen,T.H., Leiserson,C.E.,Rivest,R.L.: Introduction to Algorithms. MIT Press, Cambridge, Massachusetts, London, England 1990.