Design and Analysis of Algorithms

Lecturer:

Tutor:

Supervisor:

Department of Applied Informatics

Synopsis:

specification, proof of correctness, time and space complexity.

Basic data structures, sorting, selected graph algorithms.

P and NP problems.

Requirements:

none

Syllabus of lectures:

Syllabus of tutorials:

Study Objective:

Recognition of specifications of algorithmic problems. Proving of correctness of algorithms and their complexity.

Study materials:

Kozen, D.: The Design and Analysys of Algorithms, Springer, 1991.

Aho, Hopcroft, Ullman, Design and analysys of Computer Algorithms, Addison-Wesley, 1974.

[3] J. Demel, Grafy a jejich aplikace, Academia, Praha, 2002

Note:

Further information:

No time-table has been prepared for this course

The course is a part of the following study plans: