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 2018 Fall

Lecture Day Day Handouts Lecturer
1. 3.10. Asymptotic complexity recapitulation. Graph representation. 01a Průša
2. 10.10. MST problem. Union-Find problem. 01b Berezovský
3. 17.10. Directed graphs. Strongly Connected Components. Euler trail. 02 Berezovský
4. 24.10. Heaps: Binary, d-ary, binomial, Fibonacci. Heaps comparison. 03 Berezovský
5. 31.10. Isomorphism of general graphs and of trees. 04 Berezovský
6. 7.11. Generation and enumeration of combinatorial objects (subsets, k-element subsets, permutations). Gray codes. 05 Berezovský
7. 14.11. Finite automata, indeterminism, regular expressions, exact pattern matching. 08a
08b
 Berezovský
8. 21.11. Language operations, Approximate pattern matching with finite automata. 09 Průša
9. 28.11. Dictionary automata. Implementations of automata. 10 Průša
10. 5.12. Random numbers properties and generators. Prime number generators. Primality tests - randomized and exact. Fast powers. Prime factoring. 06 Průša
11. 12.12. Skip list, search trees: B, B+. 11@
11a
11b 		Průša
12. 19.12. Search trees: 2-3-4, R-B, splay. 12a
12b
12c 		Průša
13. 2.1. Searching in higher dimensions, K-D trees. 13 Průša
14. 9.1. Trie, suffix trie, binary trie. 13-trie Průša

Notes

Lecture02: Minimum Spanning Trees

Lecture05: Gray code and k-subsets, permutations.

Lecture09: Sieve of Eratosthenes.

courses/be4m33pal/lectures.txt · Last modified: 2018/12/03 10:21 by prusapa1