|
Lecturer(s)
|
-
Březina Jan, doc. Mgr. Ph.D.
-
Kosková Třísková Lenka, Ing. Ph.D.
|
|
Course content
|
The subject is oriented as a classical introduction into chosen parts of algorithm theory and theory of complexity qua basic areas of theoretical informatics. The consequence of this is the union of studentds knowledge.
|
|
Learning activities and teaching methods
|
Monological explanation (lecture, presentation,briefing)
- Class attendance
- 56 hours per semester
|
|
Learning outcomes
|
This subject represents an introduction into the theory of algorithms and theory of complexity. The mathematical formulation of the term algorithm (effective computability), play an important role in theoretical informatics and hence it is a theoretical base of education of every informatics specialist. The subject is suitable for students that are not trained mathematicians.
Obtained knowledge represent effective base of theoretical informatics. The subject alone provides overview about algorithmically possible constructions and about problems, which cannot be managed by computers. There is study effectiveness of algorithms from the point of view of time and space intensity of computer.
|
|
Prerequisites
|
Condition of registration: not any.
|
|
Assessment methods and criteria
|
Combined examination
|
|
Recommended literature
|
-
Černý, M. Výpočty. Tři svazky. Professional Publishing, Praha, 2012.
-
Kučera, L. Kombinatorické algoritmy. Praha, SNTL 1989.
-
Mareš, J. Jazyky, gramatiky a automaty. Praha. Vydavatelství ČVUT, 2004.
-
MAREŠ, J. Teoretická kybernetika. ČVUT Praha, 1997.
-
Morávek, I. Složitost výpočtů a optimální algoritmy. Praha, Academia 1984.
-
Rogers, H. Theory of Recursive Functions and Effective Computability. New York.
-
Švejdar, V. Logika, neúplnost, složitost a nutnost. Praha, Academia, 2002.
|