Summary of Study | Summary of Branches | All Subject Groups | All Subjects | List of Roles | Explanatory Notes               Instructions
 AD4M33PAL Advanced algorithms Extent of teaching: 14+6c Guarantors: Roles: P,V Language ofteaching: CS Teachers: Completion: Z,ZK Responsible Department: 13133 Credits: 6 Semester: Z

Anotation:

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

Study targets:

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

Course outlines:

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.

Exercises outline:

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.

Literature:

 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

Requirements:

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.

Keywords:

Hash table, search tree, regular language, context-free language, finite state automaton, pushdown automaton, nondeterministic automaton, syntax analysis, pattern matching.

Subject is included into these academic programs:

 Program Branch Role Recommended semester MKEEM1 Technological Systems V 1 MKEEM5 Economy and Management of Electrical Engineering V 1 MKEEM4 Economy and Management of Power Engineering V 1 MKEEM3 Electrical Power Engineering V 1 MKEEM2 Electrical Machines, Apparatus and Drives V 1 MKKME1 Wireless Communication V 1 MKKME5 Systems of Communication V 1 MKKME4 Networks of Electronic Communication V 1 MKKME3 Electronics V 1 MKKME2 Multimedia Technology V 1 MKOI1 Artificial Intelligence P 1 MKOI5 Software Engineering P 1 MKOI4 Computer Graphics and Interaction P 1 MKOI3 Computer Vision and Image Processing P 1 MKOI2 Computer Engineering P 1 MKKYR4 Aerospace Systems V 1 MKKYR1 Robotics V 1 MKKYR3 Systems and Control V 1 MKKYR2 Sensors and Instrumentation V 1

 Page updated 24.6.2019 17:52:59, semester: Z,L/2020-1, L/2018-9, Z,L/2019-20, Send comments about the content to the Administrators of the Academic Programs Proposal and Realization: I. Halaška (K336), J. Novák (K336)