Advanced algorithms

The course is not on the list Without time-table
Code Completion Credits Range Language
A4M33PAL Z,ZK 6 2P+2C Czech
The course cannot be taken simultaneously with:
Advanced algorithms (AE4M33PAL)
Advanced Algorithms (BE4M33PAL)
Department of Cybernetics

Basic graph algorithms and graph representation. Combinatorial algorithms. Application of formal languages theory in computer science - syntax analysis and pattern matching.


Individual implementation of data types and algorithms discussed in the lectures is an important part of the exercises. Thus, capabilty of programmatic manipulation of linked data structures in some of the prevalent languages (C/C++/Java/...) is indispensable.

Syllabus of lectures:

Formal and informal analysis of the memory and time complexity of all data sructures and algorithms taught is an integral part of the course, it is not expicitely listed under particular topics.

1. Asymptotic complexity of algorithms. Graphs, their properties and memory representation.

2. Minimum spanning tree. Union-Find problem.

3. Euler paths. Directed graphs: connectivity, acyclic graphs.

4. Heaps. Fibonacci heap. Heaps performance comparison.

5. Dynamic data structures. Garbage collector.

6. Generating, enumeration aand isomorphism of data structures and combinatorial objects. Permutations, combinations, variations, trees.

7. Generating other combinatorial structures: k-element subsets, Gray code, non-isomorphic graphs.

8. Search in sequences - linear and quadratic interpolation. Median search.

9. Finite automata, implementation, automaton reduction.

10. Regular expressions and text search using regular expressions.

11. Approximate text search using finite automata, dictionary automata.

12. Search in higher dimensions, K-D trees, Quadtree.

13. Search trees: B a B+; 2-3-4 a R-B trees.

14. Search trees: Trie, suffix tree, splay tree.

Syllabus of tutorials:

Exercises and related homeworks are devoted mostly to implementation of lecture topics. Consequently, the themes of each exercise formally correspond to those of respective lecture.

Study Objective:

Fundamental overview and skills related to the topics of the course.

Study materials:

R. Sedgewick: Algoritmy v C, SoftPress 2003,

T. H. Cormen, C. E. Leiserson, R. L. Rievest, C. Stein: Introduction to Algorithms, 2nd ed., MIT Press, 2001

B. Melichar: Jazyky a překlady, Praha , ČVUT 1996

J. E. Hopcroft, R. Motwani, J. D. Ullman: Introduction to Automata Theory, Languages, and Computation, 2nd ed., Addison-Wesley, 2001

Further information:
No time-table has been prepared for this course
The course is a part of the following study plans:
Data valid to 2020-01-18
For updated information see http://bilakniha.cvut.cz/en/predmet12581604.html