Warning
This page is located in archive. Go to the latest version of this course pages. Go the latest version of this page.

Timetable at FEE Students of ePAL Upload system BRUTE Discussion board

Lectures

Lecture Date Topics Handouts Lecturer Recordings
WS '20/'21
1. 21.9. Asymptotic complexity recapitulation. Graph representation. MST problem. Union-Find problem. 01
01b
01c		Berezovský viewer
2. 28.9. National holiday
3. 5.10. Euler Trail. Directed graphs. Strongly Connected Components. 02 Berezovský viewer viewer
4. 12.10. Heaps: Binary, d-ary, binomial, Fibonacci. Heaps comparison. 03 Berezovský viewer
5. 19.10. Isomorphism of graphs and trees. 04 Berezovský viewer
6. 26.10. Generation and enumeration of combinatorial objects (subsets, k-element subsets, permutations). Gray codes. 05
Step-by-step notes 		Berezovský viewer
7. 2.11. Finite automata, indeterminism, regular expressions, exact pattern matching. 08a short repetition,
08b 		Berezovský viewer
8. 9.11. Language operations, Approximate pattern matching with finite automata. 09 Berezovský viewer
9. 16.11. Dictionary automata. Implementations of automata. 10 Průša viewer (part 1) viewer (part 2)
10. 23.11. Random numbers properties and generators. Prime number generators. Primality tests - randomized and exact. Fast powers. Prime factoring. 06 Průša viewer
11. 30.11. Skip list, search trees: B, B+.11@ 11a 11b Průša viewer
12. 7.12. Search trees: 2-3-4, R-B, splay. 12a 12b 12c Průša viewer
13. 14.12. Searching in higher dimensions, K-D trees. 13 Průša viewer
14. 11.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 . 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: 2022/11/02 16:45 by berezovs