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

Theoretical problems

It is recommended to concentrate mainly on the problems located approximately in the second half of each set as the first half typically contains many questions which are just simple “warm up” problems.

Complexity
MST
Directed graphs
Heaps
Graph isomorphism
Combinatorial algorithms
Finite automata 1
Finite automata 2
Finite automata 3
Number theory algorithms
Search trees 1
Search trees 2
Search trees 3

Programming problems

courses/be4m33pal/problems.txt · Last modified: 2018/09/19 15:07 (external edit)