Course detail

Selected Chapters on Algorithms

FIT-VKDAcad. year: 2010/2011

Not applicable.

Language of instruction

Czech

Number of ECTS credits

0

Mode of study

Not applicable.

Guarantor

prof. Ing. Jan M. Honzík, CSc.

Department

Department of Information Systems (UIFS)

Learning outcomes of the course unit

Not applicable.

Prerequisites

Not applicable.

Co-requisites

Not applicable.

Planned learning activities and teaching methods

Not applicable.

Assesment methods and criteria linked to learning outcomes

Not applicable.

Course curriculum

Not applicable.

Work placements

Not applicable.

Aims

Not applicable.

Specification of controlled education, way of implementation and compensation for absences

Not applicable.

Recommended optional programme components

Not applicable.

Prerequisites and corequisites

Not applicable.

Basic literature

  • Cormen,T.H., Leiserson,C.E.,Rivest,R.L.: Introduction to Algorithms. MIT Press, Cambridge, Massachusetts, London, England 1990.

Recommended reading

Cormen,T.H., Leiserson,C.E.,Rivest,R.L.: Introduction to Algorithms. MIT Press, Cambridge

Classification of course in study plans

  • Programme VTI-DR-4 Doctoral

    branch DVI4 , any year of study, summer semester, elective

  • Programme VTI-DR-4 Doctoral

    branch DVI4 , any year of study, summer semester, elective

Type of course unit

 

Lecture

39 hours, optionally

Teacher / Lecturer

prof. Ing. Jan M. Honzík, CSc.

Syllabus

  • 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