Design and Analysis of Algorithms

Course guarantor:

Jiří Demel

Lecturer:

Tutor:

Supervisor:

Department of Applied Informatics

Synopsis:

Design and analysis of alorithms. Models of a computation. Proofs of correctness, time complexity of algorithms. Basic data structures. P and NP classes of problems.

Requirements:

Basic programming experience.

Syllabus of lectures:

Algorithmic problem, model of computation.

Proofs of correctness.

proofs of time bounds

algorithms for basic data structures

Syllabus of tutorials:

Discussion on algorithms designed by students.

Study Objective:

Ability of reasoning and argumenting concerning correctness and time complexity of algorithms.

Study materials:

!Demel, J.: Grafy a jejich aplikace, 2002, Academia Praha, ISBN 80-200-0990-6; 2. vydání vlastním nákladem 2015, ISBN 80-260-7684-1

?Kozen, D.: The Design and Analysys of Algorithms, Springer, 1991, 978-0-387-97687-7.

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

Note:

Further information:

No time-table has been prepared for this course

The course is a part of the following study plans:

• Geodézie a kartografie, specializace Geomatika (compulsory elective course)