PAL: Timetable at FEE
Students of PAL
Upload system BRUTE
Discussion board
E-PAL: Timetable at FEE
Students of E-PAL
Upload system BRUTE
Discussion board
Lecture | Date | Topics | Handouts | Lecturer |
---|---|---|---|---|
1. | 25.9. | Asymptotic complexity recapitulation. Graph representation. | 01 | Berezovský |
2. | 2.10. | MST problem. Union-Find problem. | 01b | Berezovský |
3. | 9.10. | Directed graphs. Strongly Connected Components. Euler trail. | 02 | Berezovský |
4. | 16.10. | Heaps: Binary, d-ary, binomial, Fibonacci. Heaps comparison. | 03 | Berezovský |
5. | 23.10. | Isomorphism of general graphs and of trees. | 04 | Berezovský |
6. | 30.10. | Generation and enumeration of combinatorial objects (subsets, k-element subsets, permutations). Gray codes. | 05 | Berezovský |
7. | 6.11. | Finite automata, indeterminism, regular expressions, exact pattern matching. | 08a 08b | Berezovský |
8. | 13.11. | Language operations, Approximate pattern matching with finite automata. | 09 | Průša |
9. | 20.11. | Dictionary automata. Implementations of automata. | 10 | Průša |
10. | 27.11. | Random numbers properties and generators. Prime number generators. Primality tests - randomized and exact. Fast powers. Prime factoring. | 06 | Průša |
11. | 4.12. | Skip list, search trees: B, B+. | 11@ 11a 11b | Průša |
12. | 11.12. | Search trees: 2-3-4, R-B, splay. | 12a 12b 12c | Průša |
13. | 18.12. | Searching in higher dimensions, K-D trees. | 13 | Průša |
14. | 8.1. | Trie, suffix trie, binary trie. | 14trie | Průša |
Notes
Lecture01: Theta(n^2) functions example https://www.geogebra.org/graphing/ffqr4pqe
Lecture02: Minimum Spanning Trees Prim, Dijkstra, Kruskal, Ackermann
Lecture03: DFS with time stamps at al
Lecture04: heaps, binary heap repetition
Lecture05: combinatorial generation Gray code and k-subsets, permutations.
Lecture07: Automata - text search
Lecture09: Sieve of Eratosthenes.
Lecture11: Skip list visualization (0/1 == heads/tails)
Trie, suffix trie, binary trie. 15+ - trie