|
Lecturer(s)
|
-
Švec Vlastimil, prof. PhDr. CSc.
-
Viktorin Adam, Ing. Ph.D.
-
Kadavý Tomáš, Ing. Ph.D.
|
|
Course content
|
unspecified
|
|
Learning activities and teaching methods
|
|
unspecified
|
| prerequisite |
|---|
| Knowledge |
|---|
| Znalosti z oblasti: Základy programování Teorie programu Algoritmizace a datové struktury Objektové programování |
| Znalosti z oblasti: Základy programování Teorie programu Algoritmizace a datové struktury Objektové programování |
| learning outcomes |
|---|
| The student can define and describe the basic principles of algorithmization, programming languages and their properties. |
| The student can define and describe the basic principles of algorithmization, programming languages and their properties. |
| The student understands formal languages, grammars and models of computation, including finite automata and the Turing machine. |
| The student understands formal languages, grammars and models of computation, including finite automata and the Turing machine. |
| The student has knowledge of computational complexity and combinatorial algorithms, including their practical applications. |
| The student has knowledge of computational complexity and combinatorial algorithms, including their practical applications. |
| The student understands the principles and applications of unconventional computational procedures and heuristic algorithms. |
| The student understands the principles and applications of unconventional computational procedures and heuristic algorithms. |
| The student can explain software design theory, including design patterns, software project management and software testing. |
| The student can explain software design theory, including design patterns, software project management and software testing. |
| Skills |
|---|
| The student can design and implement algorithms to solve specific problems. |
| The student can design and implement algorithms to solve specific problems. |
| The student can apply the theory of formal languages and models of computation in practical situations. |
| The student can apply the theory of formal languages and models of computation in practical situations. |
| The student can analyze and evaluate the complexity of various algorithms. |
| The student can analyze and evaluate the complexity of various algorithms. |
| The student has the skills to use unconventional computational approaches and heuristics in the learning process. |
| The student has the skills to use unconventional computational approaches and heuristics in the learning process. |
| The student is able to design, develop and test software applications, emphasizing best practices in software design and testing. |
| The student is able to design, develop and test software applications, emphasizing best practices in software design and testing. |
|
Recommended literature
|
-
Chytil, Michal. Automaty a gramatiky. 1. vyd. Praha : SNTL, 1984.
-
Vaníček J., Papík M., Pregl R., Vaníček T. Teoretické základy informatiky. Alfa Publishing, 2006.
-
Wróblewski, Piotr. Algoritmy : datové struktury a programovací techniky. Vyd. 1. Brno : Computer Press, 2004. ISBN 80-251-0343-9.
|