Faculty of Information Technology, BUT

Course details

Selected Chapters on Algorithms

VKD Acad. year 2018/2019 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

Czech

Completion

Examination (oral)

Time span

39 hrs lectures

Assessment points

Department

Lecturer

Subject specific learning outcomes and competences

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

 

Generic learning outcomes and competences

  • 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 kwnowledge 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

Exam prerequisites

Passing the presentation of the project assigned

Course inclusion in study plans

Back to top