Timetable at FEE Students of ePAL Upload system BRUTE Discussion board
Lecture | Date | Topics | Handouts | Lecturer | Recordings WS '20/'21 |
---|---|---|---|---|---|
1. | 25.9. | Asymptotic complexity recapitulation. Graph representation. | 01a | Berezovský | viewer |
2. | 2.10. | MST problem. Union-Find problem. | 01b 01c | Berezovský | viewer |
3. | 9.10. | Euler Trail. Directed graphs. Strongly Connected Components. | 02 | Berezovský | viewer |
4. | 16.10. | Heaps: Binary, d-ary, binomial, Fibonacci. Heaps comparison. | 03 | Berezovský | viewer |
5. | 23.10. | Isomorphism of graphs and trees. | 04 notes on isomorphism | Berezovský | viewer |
6. | 30.10. | Generation and enumeration of combinatorial objects (subsets, k-element subsets, permutations). Gray codes. | 05 poznámky | Berezovský | viewer |
7. | 6.11. | Finite automata, indeterminism, regular expressions, exact pattern matching. | automaty, základní opáčko 06 | Berezovský | viewer |
8. | 13.11. | Language operations, Approximate pattern matching with finite automata. | 09 | Berezovský | viewer |
9. | 20.11. | Dictionary automata. Implementations of automata. | 10 | Drbohlav | viewer pdf |
10. | 27.11. | Random numbers properties and generators. Prime number generators. Primality tests - randomized and exact. Fast powers. Prime factoring. | 07 | Drbohlav | viewer pdf |
11. | 4.12. | Skip list, search trees: B, B+. | 11@ 11a 11b | Drbohlav | viewer pdf |
12. | 11.12. | Search trees: 2-3-4, R-B, splay. | 12a 12b 12c | Drbohlav | viewer pdf |
13. | 18.12. | Searching in higher dimensions, K-D trees. | 13 | Drbohlav | viewer pdf |
14. | 8.1. | Trie, suffix trie, binary trie. | 13-trie | Drbohlav |
Ad Lecture 01 – graphs_intro
Ad Lecture 02 – DFS with time stamp (repetition) .
Ad Lecture 03 – heaps update in a heap, binary heap example, binary heap example
Ad Lecture 04 – notes on isomorphism. slides .pptx, online demonstration .
Ad Lecture 05 – allksubs.py, allperms.py , subset_ranks.py , permutation_ranks.p
ppt variants:
Lessons 03_heaps – additional notes: binary heap, binomial heap, updating nodes on a heap
Lessons 04 – isomorphism notes . Slides .pptx, online demonstration .
Lessons 05 –
allksubs.py , allperms.py , subset_ranks.py , permutation_ranks.p
Gray code on GeeksForGeeks