[[https://www.fel.cvut.cz/cz/education/rozvrhy-ng.B201/public/html/predmety/46/85/p4685106.html|Timetable at FEE]]
[[https://www.fel.cvut.cz/cz/education/rozvrhy-ng.B201/public/html/paralelky/P46/85/par4685106.1.html|Students of ePAL]] 
[[https://cw.felk.cvut.cz/brute/|Upload system BRUTE]]
[[https://cw.felk.cvut.cz/forum/forum-1682.html|Discussion board]]

----

===== Lectures =====

^ Lecture ^	Date ^	Topics ^	Handouts ^	Lecturer ^
|1.|	23.9.|	Asymptotic complexity recapitulation. Graph representation.| {{:courses:b4m33pal:2011pal01.pdf|01}}	|Berezovský|
|2.|	30.9.|	MST problem. Union-Find problem.| {{:courses:a4m33pal:2012pal02.pdf|01b}}  \\ {{ :courses:be4m33pal:mst3.pdf | 01c}}|	Berezovský|
|3.|	7.10.|	Directed graphs. Strongly Connected Components. Euler trail.| {{:courses:a4m33pal:2012pal03.pdf|02}} |Berezovský|
|4.|	14.10.|	Heaps: Binary, d-ary, binomial, Fibonacci. Heaps comparison.|	{{:courses:b4m33pal:2016pal04.pdf|03}} |	Berezovský|
|5.|	21.10.|	Isomorphism of general graphs and of trees.| {{:courses:a4m33pal:pal07.pdf|04}}	|Berezovský|
|6.|	28.10.|	Generation and enumeration of combinatorial objects (subsets, k-element subsets, permutations). Gray codes.|	{{:courses:b4m33pal:pal06.pdf|05}}|	Berezovský|
|7.|	4.11.|	Finite automata, indeterminism, regular expressions, exact pattern matching.| {{ :courses:be4m33pal:automata101.pdf | 08a}}, {{ :courses:be4m33pal:paska08b.pdf | 08b}}	|Berezovský|
|8.|	11.11.|	Language operations, Approximate pattern matching with finite automata.| {{:courses:a4m33pal:paska09.pdf|09}} |  Berezovský|
|9.|	18.11.|	Dictionary automata. Implementations of automata.| {{:courses:be4m33pal:paska10.pdf|10}} |Průša|
|10.|	25.11.|	Random numbers properties and generators. Prime number generators. Primality tests - randomized and exact. Fast powers. Prime factoring.| {{:courses:a4m33pal:pal07_2015.pdf|06}} |Průša|
|11.|	2.12.|	Skip list, search trees: B, B+.|{{:courses:a4m33pal:paska11_0.pdf|11@}} {{:courses:a4m33pal:paska11a.pdf|11a}} {{:courses:b4m33pal:paska11b.pdf|11b}}	|Průša|
|12.|	9.12.|	Search trees: 2-3-4, R-B, splay.| {{:courses:a4m33pal:2011pal03a.pdf|12a}} {{:courses:a4m33pal:paska12b.pdf|12b}} {{:courses:a4m33pal:2011pal03c.pdf|12c}} | Průša|
|13.|	16.12.|	Searching in higher dimensions, K-D trees.| {{:courses:a4m33pal:paska13.pdf|13}} |Průša|
|14.|	6.1.|	Trie, suffix trie, binary trie.| {{:courses:b4m33pal:paska13trie.pdf|14trie}}	|Průša|


Notes on combinatorial objects generation/enumeration: {{ :courses:be4m33pal:combi_notes0.pdf | subsets }} {{ :courses:be4m33pal:combi_notes1.pdf | k-subsets}} {{ :courses:be4m33pal:combi_notes2.pdf | permutations }}