Course detail
Theoretical Informatics
FEKT-BPC-TINAcad. year: 2023/2024
Object oriented design. Abstract datat types, theoretical models, directed and undirected graphs, graph representation methods. Deterministic and nondeterministic automata. Data structures and objects. Spanning tree, shortest paths in graphs, Parallel and sequential algorithms. Distributed algorithms. Optimization, genetic algorithms.
Language of instruction
Czech
Number of ECTS credits
7
Mode of study
Not applicable.
Guarantor
Department
Entry knowledge
The fundamentals of programming and communication technology are required.
Rules for evaluation and completion of the course
Students are evaluated according to their activities in laboratories and by the final exam. The concrete distribution is specified in an yearly published supervisor's notice.
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.
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
To provide theoretical knowledge of information gathering, processing and sharing in communication systems, and of their structure, behaviour and mutual interaction.
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.
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
Not applicable.
Prerequisites and corequisites
Not applicable.
Basic literature
Aktuální studijní materiály jsou k dispozici v elearningu na adrese / Study materials are available at : https://www.vutbr.cz/elearning/ (CS)
Goodrich, T.M., Tamassia, R.: Data Structures and Algorithms in Java. John Wiley & Sons, 2000. (EN)
Leuwen, J., Watanabe, O., Hagiya, M.: Exploring New Frontiers of Theoretical Informatics. Springer, 2000. (EN)
Goodrich, T.M., Tamassia, R.: Data Structures and Algorithms in Java. John Wiley & Sons, 2000. (EN)
Leuwen, J., Watanabe, O., Hagiya, M.: Exploring New Frontiers of Theoretical Informatics. Springer, 2000. (EN)
Recommended reading
Battista, G., Tollis, I.: Graph Drawing: Algorithms for the Visualization of Graphs. Prentice Hall, 1998. (EN)
James Edward Keogh, Ken Davidson, Datové struktury bez předchozích znalostí, Computer Press, 2006 - Počet stran: 223 (CS)
James Edward Keogh, Ken Davidson, Datové struktury bez předchozích znalostí, Computer Press, 2006 - Počet stran: 223 (CS)
Elearning
eLearning: currently opened course
Classification of course in study plans
- Programme BPC-IBE Bachelor's 2 year of study, summer semester, compulsory
Type of course unit
Exercise in computer lab
39 hod., compulsory
Teacher / Lecturer
Elearning
eLearning: currently opened course