Course detail

Data Structures and Algorithms

FEKT-MPC-DSAAcad. year: 2020/2021

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

Learning outcomes of the course unit

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.

Prerequisites

Not applicable.

Co-requisites

Not applicable.

Recommended optional programme components

Not applicable.

Recommended or required reading

Burget, R., Teoretická Informatika, VUT v Brně, ISBN: 978-80-214-4897-1, 2013 (CS)
Burget, R., Teoretická informatika - cvičení, VUT v Brně, 2014 (CS)

Planned learning activities and teaching methods

Teachning methods include lectures, computer laboratories and practical laboratories. Course is taking advantage of e-learning (Moodle) system. Students have to write a single project/assignment during the course.

Assesment methods and criteria linked to learning outcomes

final examination

Language of instruction

Czech

Work placements

Not applicable.

Course curriculum

1. Information representation, objective oriented design
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

To provide theoretical knowledge of information gathering, processing and sharing in communication systems, and of their structure, behaviour and mutual interaction.

Specification of controlled education, way of implementation and compensation for absences

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.

Classification of course in study plans

  • Programme MPC-AUD Master's

    specialization AUDM-TECH , 1. year of study, winter semester, 6 credits, compulsory
    specialization AUDM-ZVUK , 1. year of study, winter semester, 6 credits, compulsory-optional

  • Programme MPC-TIT Master's, 1. year of study, winter semester, 6 credits, compulsory

Type of course unit

 

Lecture

26 hours, optionally

Teacher / Lecturer

Exercise in computer lab

39 hours, compulsory

Teacher / Lecturer

eLearning