Course detail
Data Structures and Algorithms
FEKT-MPC-DSAAcad. year: 2021/2022
Information representation, computability and complexity, deterministic and non-deterministic automata, linear data structures, tree data structures, graphs, knowledge mining, optimization, processes, threads and parallel computations, distributed algorithms
Guarantor
Department
Learning outcomes of the course unit
Prerequisites
Co-requisites
Recommended optional programme components
Literature
Burget, R., Teoretická informatika - cvičení, VUT v Brně, 2014 (CS)
Planned learning activities and teaching methods
Assesment methods and criteria linked to learning outcomes
Language of instruction
Work placements
Course curriculum
2. Information representation, introduction to data structures
3. Complexity, computability and automata theory
4. Information representation, linear data structures and sorting
5. Information representation - tree data structures
6. Information representation - graph theory
7. Information acccess - spanning tree
8. Information acccess - graph search
9. Information acccess - data mining
10. Information acccess - decision trees
11. Information acccess - genetic algorithms
12. Information acccess - genetic algorithms, II.
13. Multithreaded computations, parallelization
14. Final exam
Aims
Specification of controlled education, way of implementation and compensation for absences
Classification of course in study plans
Type of course unit
Exercise in computer lab
Teacher / Lecturer
eLearning