Course details

Selected Chapters on Algorithms

VKA Acad. year 2006/2007 Summer semester

Current academic year

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

Honzík Jan M., prof. Ing., CSc. (DIFS)

Language of instruction

Czech

Completion

Examination

Time span

  • 39 hrs lectures

Department

Department of Information Systems (UIFS)

Subject specific learning outcomes and competences

  • Student shows the creative capabilities in edvanced algoritmhs on the doctoral level

  • Student shows high quality presentation of the results of the project assigned

Learning objectives

To command the behaviour of the advanced algorithms and data structures. To be acquainted with their fatures, conplexity and applications.

Prerequisite knowledge and skills

  • Knowledge of the algorithmization on the master degree level 

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

Progress assessment

Study evaluation is based on marks obtained for specified items. Minimimum number of marks to pass is 50.

Passing the presentation of the project assigned

Controlled instruction

There are no checked study.

Back to top