Description:

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

Contents:

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:

Seminar contents:

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

Recommended literature:

Key references:[1] Virius, M.: Základy algoritmizace v C++. 3. vydání. Praha, ČVUT 2014. ISBN 978-80-01-05606-6
(in Czech).
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.

Keywords:

algorithm;complexity;list;tree;b-tree;hash table;graph;recursion;divide and conquer;greedy method;duynamic programming;backtracking;Monte Carlo method;sorting;balanced tree;number system;seminumerical algorithms

Abbreviations used:

Semester:

• W ... winter semester (usually October - February)
• S ... spring semester (usually March - June)
• W,S ... both semesters

Mode of completion of the course:

• A ... Assessment (no grade is given to this course but credits are awarded. You will receive only P (Passed) of F (Failed) and number of credits)
• GA ... Graded Assessment (a grade is awarded for this course)
• EX ... Examination (a grade is awarded for this course)
• A, EX ... Examination (the award of Assessment is a precondition for taking the Examination in the given subject, a grade is awarded for this course)

Weekly load (hours per week):

• P ... lecture
• C ... seminar
• L ... laboratory
• R ... proseminar
• S ... seminar