Students will understand all the layers of the computer based systems including hardware (semiconductor components, logic networks, processors, peripheral devices), software (control and data structures, object orientation, programming languages, compilers, operating systems, databases), as well as their common applications (information systems, computer networks, artificial intelligence, computer graphics and multimedia). They will understand foundations of computer science (discrete mathematics, formal languages and their models, spectral analysis of signals, modelling and simulation). Graduates will be able to analyse, design, implement, test, and maintain common computer applications. They will be able to work efficiently in teams.

State Exam in Information Technology and Artificial Intelligence, specialization Mathematical Methods consists of the following parts:

• presentation and defense of Master's thesis,

• oral exam, which combines the basic themes contained in the subjects profiling the basis of Information Technology and Artificial Intelligence (Theoretical Computer Science, Statistics and Probability, Computer Systems Architectures, Artificial Intelligence and Machine Learning, Data Storage and Preparation, Functional and Logic Programming, Parallel and distributed algorithms, Modern trends of informatics),

• oral exam, which combines the basic themes contained in the subjects profiling the basis of mathematical methods (Static Analysis and Verification, Complexity, Compiler Construction, Game Theory, Algebra, Graph Algorithms).

All parts of the State Final Examination take place on the same date before the State Examination Board. The state exam can be taken by a student who has obtained the required number of credits in the prescribed composition necessary for the successful completion of the master's degree and has submitted the Master's thesis in due time. The organization and course of the state examination are given by the corresponding internal standard of the faculty and by the relevant instructions of the program guarantor for state examinations.

• Human interface to MONA automated libraries
• Educational tool for colored Petri nets
• Application of approximate equivalence in the design of approximate circuits
• Comparison of languages and reduction of automata used in network traffic filtering
• Path-driven grammars
• A Decision Procedure for WSkS Logic
• Static analysis of possible values of variables in C programs
• Data mining predictions in test results history
• Analysis of work with dynamic data structures in C programs
• Heuristics in RCPSP class optimization tasks

Master's theses are stored at the FIT library, Božetěchova 2, Brno. The list of the master's theses, including the details is available at:
https://www-dev.fit.vutbr.cz/study/theses/