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
1. 23.9. Asymptotic complexity recapitulation. Graph representation. 01 Berezovský
2. 30.9. MST problem. Union-Find problem. 01b
01c		 Berezovský
3. 7.10. Directed graphs. Strongly Connected Components. Euler trail. 02 Berezovský
4. 14.10. Heaps: Binary, d-ary, binomial, Fibonacci. Heaps comparison. 03 Berezovský
5. 21.10. Isomorphism of general graphs and of trees. 04 Berezovský
6. 28.10. Generation and enumeration of combinatorial objects (subsets, k-element subsets, permutations). Gray codes. 05 Berezovský
7. 4.11. Finite automata, indeterminism, regular expressions, exact pattern matching. 08a, 08b Berezovský
8. 11.11. Language operations, Approximate pattern matching with finite automata. 09 Berezovský
9. 18.11. Dictionary automata. Implementations of automata. 10 Průša
10. 25.11. Random numbers properties and generators. Prime number generators. Primality tests - randomized and exact. Fast powers. Prime factoring. 06 Průša
11. 2.12. Skip list, search trees: B, B+.11@ 11a 11b Průša
12. 9.12. Search trees: 2-3-4, R-B, splay. 12a 12b 12c Průša
13. 16.12. Searching in higher dimensions, K-D trees. 13 Průša
14. 6.1. Trie, suffix trie, binary trie. 14trie Průša

Notes on combinatorial objects generation/enumeration: subsets k-subsets permutations

courses/be4m33pal/lectures.txt · Last modified: 2020/11/11 19:53 by berezovs