• An introduction to Upload system, 0-th programming optional (not graded) task, its specification can be found here.
  Write a program that solves the task. Upload it and check how the system assesses it. Follow strictly the rules specified on page Upload System.
  
• More homework appear in the upload system later, when assigned.

The following topics are considered fundamental and known to the students from their previous years of study. Everybody is invited to check themselves the related problems listed below. In need of assistance or explanation talk to your labs or lectures teacher(s). Asymptotic complexity and graphs representation will not appear as as an explicit training topic in PAL practices.

• Asymptotic complexity recap. Training problems are here.
• Graphs and their representations, BFS, DFS. Solve example exam problems. Additional training problems can be found here.
• For more thorough or necessary basic acquaintance with the related topics consult the book Problems on Algorithms. Student are expected to be able to solve any problem marked by one cap in chapters 2. and 3. both during the semester and at the exam. We recommend problems 64. - 66., 144. - 148., 163. - 170. as an easy start.

The list of exam topics related to particular weeks in practices is at the bottom of this page.

• Spanning trees and minimum spanning trees of graphs: example problems. More problems for training here.

• Problems for personal training: Directed graphs, strongly connected components, Eulerian graphs: set 1, set 2.
• Additional: Directed graphs with comments/solutions

• Binary, d-ary, binomial heaps. Fibonacci heaps. Example problems.
• Additional problems for training here

• Graph and tree isomorphism. Example problems.
• Additional problems for training here
  

• Combinatorial generation of subsets, permutations and their ranks. Example problems.
• Additional problems for training here
  

Kreher, Stinson: Combinatorial Algorithms, notes: page 30, 31, page 32, 33, page 34, 35, page 36, 37, page 38, 39, page 40, 41, page 42, 43, page 44, 45, page 52, 53, page 54, 55, page 56, 67.

• Finite automata and regular expressions. Example problems.
• Additional problems for training here
  

• Approximate pattern matching and language operations. Example problems
• Text Searching. Additional problems for training here
  

• Approximate text searching example problems.
• Additional problems for training here.
  

Primes and pseudorandom numbers – Example problems .

• Skip List, B and B+ trees example problems.

• 2-3-4 trees and B+ trees, splay trees. Additional problems for training here
  

• KD trees, Nearest neighbours problem. Example problems incl. previous week.

• Binary trie, Patricia trie Example problems.

In preparation
* Radix trie, suffix trie, segment tree.

• Binary search tree
• AVL tree
• B tree
• B+ tree
• Red-black tree
• Splay tree
• 2-3-4 tree

• Heaps with comments/solutions
• Isomorphism with comments/solutions
• Combinatorial generation with comments/solutions
• Finite automata and text search I with comments/solutions
• Finite automata and text search II with comments/solutions
• Finite automata and text search III with comments/solutions

1st week

• Asymptotic notations, asymptotic complexity, graph representations.
• Boruvka's, Kruskal's, Prim's algorithms. Their implementation and data structures, ie. priority queues and Union-Find.
• Prim's algorithm without a queue.
• Union-Find implementations.

2nd week

• Eulerian graph (directed and undirected), Eulerian path/cycle, method of finding them.
• Strong and weak connectivity, strong and weak components, graph condensation. Algorithms which find strong components or produce a condensation.
• Topological ordering of a graph using DFS or using gradual roots/leaves removal.

3rd week

• The heap rule. Standard operations on heaps. Binary, d-ary and binomial heap.
• Binary and d-ary heap implemented in an array.
• Fibonacci heap, amortized complexity of its operations.

4th week

• Graph isomorphism, definition, invariants, algorithm for finding all isomorphisms.
• Isomorphism and certificates of undirected trees, computing the certificate for a tree and reconstructing a tree from a certificate.

5th week

• Combinations, variations, permutations with or without repetition, definitions, formulas. Binomial coefficients, their basic relations, Pascal triangle.
• Operations(functions) Rank and UnRank for ordered permutations and k-element subsets of given set.
• Gray code - definition, properties, operations Rank and UnRank.

6th week

• Deterministic and non-deterministic finite automaton (DFA and NFA), definition. Languages accepted by finite automata.
• Algorithm for transforming NFA to DFA, simulation of NFA work without transformation to DFA. Epsilon-transitions and their removal from an automaton.
• Regular expressions. Definition, algorithm for transformation of regular expression to NFA.

7th week

• Construction of NFA for pattern matching. Impelementation of NFA/DFA by a table or by code.
• Hamming and Levenshtein distance. NFA/DFA for search of substrings which have nonzero distance from a given pattern.

8th week

• Finding dictionary entries in a text with the help of dictionary automaton.
• Number of states of dictionary NFA, DFA.
• Approximate text search based on previous methods.

9th week
Canceled, holidays.
10th week

• Generation of random numbers and prime numbers. Their properties. Prime factorization, exact and randomized primality tests.

11th week

• Skip list
• Search trees B and B+. Asymptotic complexity of particular search tree operations.

12th week
2-3-4 trees and B+ trees. Asymptotic complexity of particular search tree operations. 13th week
KD trees, search for Nearest Neighbour in 2D. 14th week

• Trie, suffix trie, binary trie