Basics of Algorithmization

Lecturer:

Miroslav Virius (gar.)

Tutor:

Miroslav Virius (gar.)

Supervisor:

Department of Software Engineering in Economy

Synopsis:

This course is devoted to selected algorithms and methods for algorithm design. This course intruduces selected methods for the determination of the algorithm complexity.

Requirements:

Basic of programming

Syllabus of lectures:

1. Algorithm, its description, its complexity

2. Data structures

3. Algorithm design methods

4. Recursion.

5. Ordering(sorting)

6. Balanced trees, optimal trees.

7. Seminumerical algorithms:

Syllabus of tutorials:

The sylabus of the excercises is the same as the sylabus of the lecture.

Study Objective:

Knowledge:

Common algorithms (such as sorting) and common data structurs (such as the list, the tree, the hash table).

Ability:

Using the usual methods for algorithm design and in selected cases determining the algorithm complexity.

Study materials:

Key references:[1] Virius, M.: Základy algoritmizace. 2. vydání. Praha, ČVUT 2008. ISBN 978-80-01-04003-4

Recommended references:

[1] Knuth, Donald E. The Art of the Computer Programming. Vol. 1, 2, 3. Addison-Wesley Professional 1998. ISBN: 0201485419

[2] Wirth, N. Algorithms + Data Structures = Programs. Prentice Hall 1975.

[3] Topfer, P. Algoritmy a programovací techniky. Praha, Prometheus 1995.

Note:

Time-table for winter semester 2011/2012:

Time-table is not available yet

Time-table for summer semester 2011/2012:

Time-table is not available yet

The course is a part of the following study plans: