Timetable Upload system BRUTE Discussion board
Lecturers: Ondřej Drbohlav (OD), Max Hollmann (MH)
| Lecture | Date | Topics | Handouts | Lecturer | Recordings WS '20/'21 |
|---|---|---|---|---|---|
| 1. | 24.9. | Asymptotic complexity recapitulation. Graph representation. | 01a | OD | viewer |
| 2. | 1.10. | MST problem. Union-Find problem. | 01b 01c | OD | viewer |
| 3. | 8.10. | Euler Trail. Directed graphs. Strongly Connected Components. | 02 | OD | viewer |
| 4. | 15.10. | Heaps: Binary, d-ary, binomial, Fibonacci. Heaps comparison. | 03 | OD | viewer |
| 5. | 22.10. | Isomorphism of graphs and trees. | 04 notes on isomorphism | OD | viewer |
| 6. | 29.10. | Generation and enumeration of combinatorial objects (subsets, k-element subsets, permutations). Gray codes. | 05 poznámky | OD | viewer |
| 7. | 5.11. | Finite automata, indeterminism, regular expressions, exact pattern matching. | automata 101 06 | OD | viewer |
| 8. | 12.11. | Language operations, Approximate pattern matching with finite automata. | 09 | OD | viewer |
| 9. | 19.11. | Dictionary automata. Implementations of automata. | OD | viewer pdf | |
| 10. | 26.11. | Random numbers properties and generators. Prime number generators. Primality tests - randomized and exact. Fast powers. Prime factoring. | 07 | MH | viewer pdf |
| 11. | 3.12. | Skip list, search trees: B, B+. | 11@ 11a 11b | MH | viewer pdf |
| 12. | 10.12. | Search trees: 2-3-4, R-B, splay. | 12a 12b 12c | MH | viewer pdf |
| 13. | 17.12. | Searching in higher dimensions, K-D trees. | 13 | OD | viewer pdf |
| 14. | 7.1. | Trie, suffix trie, binary trie. | 13-trie | OD |
Ad Lecture 01 – graphs_intro
Ad Lecture 02 – DFS with time stamp (repetition) .
Ad Lecture 04 – heaps update in a heap, binary heap example, binary heap example
Ad Lecture 05 – notes on isomorphism. slides .pptx, online demonstration .
Ad Lecture 06 – allksubs.py, allperms.py , subset_ranks.py , permutation_ranks.py , comments on applications: From professors at CTU and from AI
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