Course detail
Theoretical Informatics
FEKT-MTINAcad. year: 2016/2017
Theoretical models, directed and undirected graphs, graph representation methods. Deterministic and nondeterministic automata. Data structures and objects. Parallel, sequential and stochastic algorithms. Mass operation systems. Distributed algorithms. Stochastic processes. Optimization, genetic algorithms. Visualization of and searching for information. Data securing theory - cryptography, steganography.
Language of instruction
Number of ECTS credits
Mode of study
Guarantor
Department
Learning outcomes of the course unit
Prerequisites
Co-requisites
Planned learning activities and teaching methods
Assesment methods and criteria linked to learning outcomes
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 programming
13. Multithreaded computations, parallelization
14. Final exam
Work placements
Aims
Specification of controlled education, way of implementation and compensation for absences
Recommended optional programme components
Prerequisites and corequisites
Basic literature
Burget, R., Teoretická informatika - cvičení, VUT v Brně, 2014 (CS)
Burget, R., Teoretická Informatika, VUT v Brně, ISBN: 978-80-214-4897-1, 2013 (CS)
Recommended reading
Goodrich, T.M., Tamassia, R.: Data Structures and Algorithms in Java. John Wiley & Sons, 2000. (EN)
James Edward Keogh, Ken Davidson, Datové struktury bez předchozích znalostí, Computer Press, 2006 - Počet stran: 223 (CS)
Leuwen, J., Watanabe, O., Hagiya, M.: Exploring New Frontiers of Theoretical Informatics. Springer, 2000. (EN)
Classification of course in study plans
Type of course unit
Lecture
Teacher / Lecturer
Syllabus
Fundamentals of graph theory.
Deterministic and nondeterministic algorithms.
Data structures and objects.
Algorithm theory.
Fundamentals of queue theory.
Distributed algorithm theory and calculations.
Stochastic processes.
Optimatization and genetic algorithms.
Visualization of information.
Searching for information.
Data securing theory.
Information compression theory.
Exercise in computer lab
Teacher / Lecturer
Syllabus
Objects and classes.
Interface and packages.
Data structures and operators.
Generation of classes and applications.
Generation and treatment of exceptions.
Generation of applet.
Graphics and animation.
Interactivity and event processing.
Threads and multithreading.
Network programming.
JAVA programming tools.
Review exercise and credit pass.