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

PAL: Timetable at FEE Students of PAL Upload system BRUTE Discussion board
E-PAL: Timetable at FEE Students of E-PAL Upload system BRUTE Discussion board


The problems for each topic in Czech are on the bottom of the page.

The Basics

Introduction and repetitions

  • Asymptotic complexity recap. Training problems are here. Another set in Czech.
  • 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.

Upload system

  • 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 asseses it. Follow strictly the rules specified on page Upload System.

Training homework problem

  • The solution and submission is not mandatory and it is not graded if submitted. The problem itself is extremely simple, you can utilize it is to get acquainted with the upload system. Upload System.

Problem statement and public data

1st week

First homework problem

MST clusters

Exam topics

  • 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

  • Directed graphs, strongly connected components, Eulerian graphs example problems .
  • Additional problems for training here

Exam topics

  • 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

Second homework problem

To be specified

Exam topics

  • 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

Exam topics

  • 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

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

Kreher, Stinson: Combinatorial Algorithms, notes:

Third homework problem

To be specified

Exam topics

  • 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

Exam topics

  • 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

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

Fourth homework problem

Intermediate WordsTo be specified

Exam topics

  • 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

Exam topics

  • 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

Primes and pseudorandom numbers – Example problems .

Fifth homework problem

To be specified

Exam topics

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

10th week

Exam topics

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

11th week

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

Sixth homework problem

To be specified

Exam topics
2-3-4 trees and B+ trees. Asymptotic complexity of particular search tree operations.

12th week

Exam topics
KD trees, search for Nearest Neighbour in 2D.

13th week

In preparation

  • Trie, suffix trie, binary trie

Exam topics

  • Trie, suffix trie, binary trie

14th week

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

Exam topics
* Radix trie, Patricia trie, segment tree.

Problems in Czech

Week Topics Problems
1. Asymptotic complexity, graphs basics cv01.docx
2. MST
3. Strong connectivity, Eulerian path
4. Heaps haldy.docx
5. Graph isomorphism cviso-1.doc
6. Ranking, combinatorial objects generators kombi1.docx
7. DFA, NFA 1 ata1.docx
8. DFA, NFA 2
9. DFA, NFA 3 ata3.docx
10. Prime numbers and random generators cvrndprimes.docx
11. Skip list, B/B+ tree cv11_2015.docx
12. Splay, AVL, RB tree opakování, AVL, splay , B, splay.
13. kD-trees cv13mb.docx
14. Trie cv14_2017.docx

some data

courses/b4m33pal/seminars.txt · Last modified: 2020/02/03 08:56 by berezovs