Study program: F3 Computer science

Degree: Bachelor

Type of module: lectures, practical work

Lecturer: Assoc. Prof., PhD Vadim Shergin

Language: English

Credit Points: 4 ECTS

Description:
Basic (professional) training disciplines by Programme Subject Area (required) contains content modules:
1. Fundamentals of algorithm analysis: Determination of growth rate. Classification of growth rates. Complexity of algorithms. Estimating the time complexity of algorithms.
2. Search & sorting algorithms: Sequential search. Binary search. Simple sorting algorithms, digital sorting. Merge sort, quicksort, heapsort
3. Fast algorithms: Examples of fast algorithms. Fast Fourier transform. Practical application of fast algorithms.
4. Methods of describing algorithms: Intuitive general properties of algorithm. Algorithm definition through Church's thesis. Recursive functions. Turing's thesis. Turing machines. Register machines. Description of the algorithm in natural language. Pseudocode. Graphic method presentation of the algorithm. Solvability and unsolvability of algorithmic problems.