CZECH TECHNICAL UNIVERSITY IN PRAGUE
STUDY PLANS
2023/2024

Code Completion Credits Range Language
B4M33PAL Z,ZK 6 2P+2C Czech

It is not possible to register for the course B4M33PAL if the student is concurrently registered for or has already completed the course AE4M33PAL (mutually exclusive courses).

It is not possible to register for the course B4M33PAL if the student is concurrently registered for or has already completed the course BE4M33PAL (mutually exclusive courses).

In order to register for the course B4M33PAL, the student must have registered for the required number of courses in the group BEZBM no later than in the same semester.

It is not possible to register for the course B4M33PAL if the student is concurrently registered for or has previously completed the course AE4M33PAL (mutually exclusive courses).

It is not possible to register for the course B4M33PAL if the student is concurrently registered for or has previously completed the course BE4M33PAL (mutually exclusive courses).

The requirement for course B4M33PAL can be fulfilled by substitution with the course BE4M33PAL.

Garant předmětu:
Daniel Průša
Lecturer:
Marko Genyk-Berezovskyj, Daniel Průša
Tutor:
Ondřej Drbohlav, Marko Genyk-Berezovskyj, Daniel Průša, Petr Ryšavý
Supervisor:
Department of Cybernetics
Synopsis:

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

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.

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

Note:
Further information:
https://cw.fel.cvut.cz/wiki/courses/B4M33PAL
Time-table for winter semester 2023/2024:
 06:00–08:0008:00–10:0010:00–12:0012:00–14:0014:00–16:0016:00–18:0018:00–20:0020:00–22:0022:00–24:00 roomKN:E-107Genyk-Berezovskyj M.Průša D.11:00–12:30(lecture parallel1)Karlovo nám.Zengerova posluchárna K1roomKN:E-126Drbohlav O.12:45–14:15(lecture parallel1parallel nr.102)Karlovo nám.Trnkova posluchárna K5roomKN:E-127Drbohlav O.14:30–16:00(lecture parallel1parallel nr.105)Karlovo nám.Kotkova cvičebna K4roomKN:E-127Drbohlav O.16:15–17:45(lecture parallel1parallel nr.106)Karlovo nám.Kotkova cvičebna K4 roomFS_KN:A-312Genyk-Berezovskyj M.Průša D.11:00–12:30(lecture parallel1)Karlovo nám.Posluchárna FS A:312 - záp. roomKN:E-127Ryšavý P.07:30–09:00(lecture parallel1parallel nr.101)Karlovo nám.Kotkova cvičebna K4roomKN:E-127Ryšavý P.11:00–12:30(lecture parallel1parallel nr.103)Karlovo nám.Kotkova cvičebna K4roomKN:E-127Drbohlav O.12:45–14:15(lecture parallel1parallel nr.104)Karlovo nám.Kotkova cvičebna K4 roomKN:E-12807:30–09:00(lecture parallel1parallel nr.107)Karlovo nám.Cvičebna K3
Time-table for summer semester 2023/2024:
Time-table is not available yet
The course is a part of the following study plans:
Data valid to 2024-04-11
Aktualizace výše uvedených informací naleznete na adrese https://bilakniha.cvut.cz/en/predmet4684006.html