Course detail
Data Structures and Algorithms
FEKT-MKC-DSAAcad. year: 2025/2026
1. Information representation – object oriented design
2. Information representation – introduction to data structures, abstract data types
3. Computability and complexity, deterministic and non-deterministic automata
4. Representation of information - linear data structures
5. Representation of information - tree data structures
6. Representation of information - graphs
7. Access Information– spanning tree
8. Access Information - finding a path in graphs
9. Access Information - mining knowledge from data
10. Information Disclosure - Optimization
11. Information Disclosure - Status Space Search, Genetic Algorithms
12. Processes, threads, and parallel calculations
13. Parallel, sequential and random algorithms. Distributed algorithms
Language of instruction
Number of ECTS credits
Mode of study
Guarantor
Department
Entry knowledge
Rules for evaluation and completion of the course
The content and forms of instruction in the evaluated course are specified by a regulation issued by the lecturer responsible for the course and updated for every academic year.
Aims
Students have skills of design and implementation of various forms of abstract data types and its application to solve specific problems. To solve them the stduents can use linear, tree and graph data structures, furthemore they can search in the data structures and used genetic algorithms for search in a search space and optimization.
Study aids
Prerequisites and corequisites
Basic literature
Burget, R., Teoretická Informatika, VUT v Brně, ISBN: 978-80-214-4897-1, 2013 (CS)
Recommended reading
Classification of course in study plans
- Programme MPC-TIT Master's 1 year of study, winter semester, compulsory