Lectures 2015 Fall

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