Timetable at FEE Students of ePAL Upload system BRUTE Discussion board

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

Exam programming problems from previous years are listed below.

**Directed graphs**

Refactoring of a Simplified Makefile

Maximum path

Shortcut edges

Increasing Training Load

Reverse an Edge

Leaking canals inspection

Wayfarers

**Euler trail**

Winter Maintenance Service

**Generation of various combinatorial structures**

The Mastermind-- Assistant Program

Counting Spanning Trees

The Puzzle

Isomorphic permutations

Historical Segmented Belts

**Graph isomorphism**

Small Graphs Isomorphism

Binary Rooted Tree Isomorphism

Similar weighted binary rooted trees

Tree isomorphism

Molecules

Connected Networks

**Graph searching**

Maximum Augmenting Sequence

Telescopes connection

Marsh Causeway

Road Trip

Word Game

**Minimum spanning tree**s

Minimum Cascading Spanning Tree

Campus

Hedgehog Minimum Spanning Tree

Backup Connection

New advances in gravitational waves observations

Electrification of a rural area

**Number theory**

Linear congruential generator

Counting linear congruential generators

On Certain Lehmer Generators

**Priority queues**

Building Binomial Heaps

**Properties of finite automata and regular language**s

Dictionary automaton

PAL distance

Finite and infinite languages

The Word Counter

The NFA Counter

Identification of minimal DFA

Incomplete Automaton

Words with given prefix

Bud words

**Text searching**

Basic Committee Work Model

Text Search

Dictionaries

Trains dispatching

Search for a polynomial

courses/be4m33pal/problems.txt · Last modified: 2021/09/17 12:51 by berezovs