[[https://www.fel.cvut.cz/cz/education/rozvrhy-ng.B171/public/cz/predmety/46/85/p4685106.html|Timetable at FEE]]
[[https://www.fel.cvut.cz/cz/education/rozvrhy-ng.B171/public/cz/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-1442.html|Discussion board]]


---------------

====== Lectures 2017 Fall ======



^ Lecture  ^ Day            ^  Day            ^  Handouts    ^   Lecturer  ^
|  **1.**  |  4.10. | Asymptotic complexity recapitulation. Graph representation. MST problem. Union-Find problem.| {{courses:a4m33pal:2011pal01.pdf|01a}}  {{courses:a4m33pal:2012pal02.pdf|01b}}  | Průša  |
|  **2.**  |  11.10. | Directed graphs. Strongly Connected Components. Euler trail.  | {{courses:a4m33pal:2012pal03.pdf|02}}   | Berezovský  |
|  **3.**  |  18.10. | Heaps: Binary, d-ary, binomial, Fibonacci. Heaps comparison.   | {{courses:b4m33pal:2016pal04.pdf|03}}  | Berezovský  |
|  **4.**  |  25.10. | Isomorphism of general graphs and of trees.    | {{:courses:a4m33pal:pal07.pdf  | 04}}  | Berezovský  | 
|  **5.**  |  1.11. | Generation and enumeration of combinatorial objects (subsets, k-element subsets, permutations). Gray codes.  | {{courses:a4m33pal:2012pal06.pdf|05}}    | Berezovský  |
|  **6.**  |  8.11. | Finite automata, indeterminism, regular expressions, exact pattern matching.   | {{:courses:a4m33pal:2011pal07a.pdf| 08a }}\\ {{:courses:a4m33pal:paska08b.pdf| 08b}}\\   | Průša  | 
|  **7.**  |  15.11. | Language operations, Approximate pattern matching with finite automata.  | {{:courses:a4m33pal:paska09.pdf|09}} | Průša  |
|  **8.**  |  22.11. | Dictionary automata. Implementations of automata.  | {{:courses:a4m33pal:paska10.pdf| 10 }} | Průša  |
|  **9.**  |  29.11. | Random numbers properties and generators. Prime number generators. Primality tests - randomized and exact. Fast powers. Prime factoring.  | {{:courses:a4m33pal:pal07_2015.pdf| 06}}  | Berezovský |
|  **10.**  |  6.12. | Skip list, search trees: B, B+.  | {{:courses:a4m33pal:paska11_0.pdf| 11@}} \\ {{:courses:a4m33pal:paska11a.pdf| 11a}} \\ {{:courses:a4m33pal:paska11b.pdf| 11b }} | Průša  | 
|  **11.**  |  13.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  | 
|  **12.**  |  20.12. | Searching in higher dimensions, K-D trees.   | {{:courses:a4m33pal:paska13.pdf| 13 }} | Průša  | 
|  **13.**  |  3.1. | Trie, suffix trie, binary trie. | (In preparation) | Průša  |
|  **14.**  |  10.1. | Radix trie, segment tree  | (In preparation)| Průša  | 

**Notes**

Lecture05: {{:courses:be4m33pal:lesson05_pp31_45.pdf| Gray code and k-subsets}}, {{:courses:be4m33pal:lesson05_pp52_57.pdf| permutations}}.

Lecture09: {{:courses:be4m33pal:primes.pdf|Sieve of Eratosthenes}}.