Timetable at FEE Students of ePAL Upload system BRUTE Discussion board


Lectures

Lecture Date Topics Handouts Lecturer Recordings
WS '20/'21
1. 22.9. Asymptotic complexity recapitulation. Graph representation. MST problem. Union-Find problem. 01
01b
01c
Berezovský viewer
2. 29.9. Euler Trail. Directed graphs. Strongly Connected Components. 02 Berezovský viewer viewer
3. 6.10. Heaps: Binary, d-ary, binomial, Fibonacci. Heaps comparison. 03 Berezovský viewer
4. 13.10. Isomorphism of graphs and trees. 04 Berezovský viewer
5. 20.10. Generation and enumeration of combinatorial objects (subsets, k-element subsets, permutations). Gray codes. 05
Step-by-step notes
Berezovský viewer
6. 27.10. Finite automata, indeterminism, regular expressions, exact pattern matching. 08a, 08b Berezovský viewer
7. 3.11. Language operations, Approximate pattern matching with finite automata. 09 Berezovský viewer
8. 10.11. Dictionary automata. Implementations of automata. 10 Průša viewer (part 1) viewer (part 2)
9. 17.11.Canceled, State Holidays
10. 24.11. Random numbers properties and generators. Prime number generators. Primality tests - randomized and exact. Fast powers. Prime factoring. 06 Průša viewer
11. 1.12. Skip list, search trees: B, B+.11@ 11a 11b Průša viewer
12. 8.12. Search trees: 2-3-4, R-B, splay. 12a 12b 12c Průša viewer
13. 15.12. Searching in higher dimensions, K-D trees. 13 Průša viewer
14. 5.1. Trie, suffix trie, binary trie. 14trie Průša viewer

Lessons 03_heaps – additional notes: binary heap, binomial heap, updating nodes on a heap

Lessons 04 – isomorphism notes pptx . Slides .pptx, online demonstration .

Lessons 05 – allksubs.py , allperms.py , subset_ranks.py , permutation_ranks.p
Gray code on GeeksForGeeks

courses/be4m33pal/lectures.txt · Last modified: 2021/11/10 14:02 by prusapa1