Z\u00e1klady (teoretick\u00e9) informatiky – KIP\/7ZAIN, 2ZAIN, XZAIN, 6PUDI, UVDOI, 3UVDI, 66UDI<\/p>\n\n\n\n
Kurz v LMS Moodle<\/a><\/p>\n\n\n\n Opora pro Z\u00e1klady informatiky<\/a> <\/p>\n\n\n\n jako dopln\u011bk lze vyu\u017e\u00edt tak\u00e9 materi\u00e1ly ke kurz\u016fm Vy\u010d\u00edslitelnost a slo\u017eitost a Gramatiky a jazyky (Form\u00e1ln\u00ed jazyky a gramatiky)<\/p>\n\n\n\n Speci\u00e1ln\u00ed bal\u00ed\u010dek multimedi\u00e1ln\u00edch materi\u00e1l\u016f (www)<\/a><\/p>\n\n\n\n Z\u00e1klady (teoretick\u00e9) informatiky – KIP\/7ZAIN, 2ZAIN, XZAIN, 6PUDI, UVDOI, 3UVDI, 66UDI Kurz v LMS Moodle Opora pro Z\u00e1klady informatiky jako dopln\u011bk lze vyu\u017e\u00edt tak\u00e9 materi\u00e1ly ke kurz\u016fm Vy\u010d\u00edslitelnost a slo\u017eitost a Gramatiky a jazyky (Form\u00e1ln\u00ed jazyky a gramatiky) Speci\u00e1ln\u00ed bal\u00ed\u010dek multimedi\u00e1ln\u00edch materi\u00e1l\u016f (www) Po\u017eadavky na studenta V prezen\u010dn\u00edm studiu 2 testy za celkem 60 bod\u016f […]<\/p>\n","protected":false},"author":1,"featured_media":0,"parent":102,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"ngg_post_thumbnail":0,"footnotes":""},"class_list":["post-99","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/web.osu.cz\/~Habiballa\/wp-json\/wp\/v2\/pages\/99","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/web.osu.cz\/~Habiballa\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/web.osu.cz\/~Habiballa\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/web.osu.cz\/~Habiballa\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/web.osu.cz\/~Habiballa\/wp-json\/wp\/v2\/comments?post=99"}],"version-history":[{"count":11,"href":"https:\/\/web.osu.cz\/~Habiballa\/wp-json\/wp\/v2\/pages\/99\/revisions"}],"predecessor-version":[{"id":372,"href":"https:\/\/web.osu.cz\/~Habiballa\/wp-json\/wp\/v2\/pages\/99\/revisions\/372"}],"up":[{"embeddable":true,"href":"https:\/\/web.osu.cz\/~Habiballa\/wp-json\/wp\/v2\/pages\/102"}],"wp:attachment":[{"href":"https:\/\/web.osu.cz\/~Habiballa\/wp-json\/wp\/v2\/media?parent=99"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}Po\u017eadavky na studenta<\/strong><\/td><\/tr> V prezen\u010dn\u00edm studiu 2 testy za celkem 60 bod\u016f a zkou\u0161kov\u00fd test za 40 bod\u016f na konci semestru. V kombinovan\u00e9m a distan\u010dn\u00edm studiu 4 koresponden\u010dn\u00ed \u00fakoly za celkem 100 bod\u016f.<\/td><\/tr> P\u0159ehled prob\u00edran\u00e9 l\u00e1tky<\/strong><\/td><\/tr> 1. Teoretick\u00e1 informatika – rozd\u011blen\u00ed, historie a \u00fa\u010del. P\u0159ehled matematick\u00fdch metod a pojm\u016f nutn\u00fdch ke studiu (mno\u017einy, relace atd.)
2. Teorie form\u00e1ln\u00edch jazyk\u016f a automat\u016f, Vy\u010d\u00edslitelnost a slo\u017eitost a Logika (z\u00e1kladn\u00ed sezn\u00e1men\u00ed, motivace pro studium, vztah k praktick\u00fdm probl\u00e9m\u016fm informatiky)
3. Intuitivn\u00ed v\u00fdklad vybran\u00fdch pojm\u016f teorie form\u00e1ln\u00edch jazyk\u016f (opravdu jen z\u00e1klady nap\u0159. funkce kone\u010dn\u00fdch automat\u016f na p\u0159\u00edkladech z praxe apod. podrobnosti v n\u00e1sledn\u00fdch kurzech)
4. Z\u00e1kladn\u00ed pojmy teorie vy\u010d\u00edslitelnosti – probl\u00e9m, rozhodnutelnost, \u010d\u00e1ste\u010dn\u00e1 rozhodnutelnost, vlastnosti
5. V\u00fdpo\u010detn\u00ed model Turingova stroje a jeho vlastnosti – nerozhodnuteln\u00e9 probl\u00e9my, p\u0159evoditelnost probl\u00e9m\u016f (zaj\u00edmav\u00e9 p\u0159\u00edklady z jin\u00fdch discipl\u00edn TI – logika, form\u00e1ln\u00ed jazyky atp.)
6. V\u00fdpo\u010detn\u00ed modely a jejich ekvivalence – Turingovy stroje vs. RAM stroje
7. V\u00fdpo\u010detn\u00ed modely a jejich ekvivalence – \u010c\u00e1ste\u010dn\u011b rekurzivn\u00ed funkce,
8. V\u00fdpo\u010detn\u00ed modely a jejich ekvivalence – PL-programy, konstrukce algoritm\u016f pro jednoduch\u00e9 probl\u00e9my pomoc\u00ed r\u016fzn\u00fdch v\u00fdpo\u010detn\u00edch model\u016f, demonstrace jejich vz\u00e1jemn\u00e9 ekvivalence
9. Teorie slo\u017eitosti algoritm\u016f, \u010casov\u00e1 a prostorov\u00e1 slo\u017eitost v\u00fdpo\u010dtu, stroje a probl\u00e9mu, odhady slo\u017eitosti – praktick\u00e9 uk\u00e1zky (\u0159azen\u00ed, vyhled\u00e1v\u00e1n\u00ed, maticov\u00e9 a grafov\u00e9 algoritmy apod.),
10. T\u0159\u00eddy slo\u017eitosti a vztahy mezi nimi, zvl\u00e1dnuteln\u00e9 vs. nezvl\u00e1dnuteln\u00e9 probl\u00e9my (PTIME vs. EXPTIME), p\u0159\u00edklady
11. Nedeterministick\u00fd TS, simulace pomoc\u00ed DTS a jej\u00ed \u010dasov\u00e1 slo\u017eitost, P=NP probl\u00e9m, NP-\u00faplnost a uk\u00e1zky probl\u00e9m\u016f
12. Polynomi\u00e1ln\u00ed p\u0159evoditelnost probl\u00e9m\u016f a jej\u00ed vyu\u017eit\u00ed
13. Abstraktn\u00ed datov\u00e9 struktury a slo\u017eitost<\/td><\/tr>Literatura<\/strong><\/td><\/tr> Z\u00e1kladn\u00ed:<\/strong>
HABIBALLA, H., PAVLISKA, V. \u00davod do teoretick\u00e9 informatiky. elektronick\u00fd u\u010debn\u00ed materi\u00e1l OU<\/em>. , 2009.
JAN\u010cAR, PETR Teoretick\u00e1 informatika<\/em>. V\u0160B TU Ostrava
http:\/\/www.cs.vsb.cz\/jancar\/TEORET-INF\/teoret-inf.htm<\/a>
Roz\u0161i\u0159uj\u00edc\u00ed:<\/strong> HABIBALLA, H. Regul\u00e1rn\u00ed a bezkontextov\u00e9 jazyky I. Ostravsk\u00e1 Univerzita, 2003.<\/em>. PAVLISKA, VIKTOR. Vy\u010d\u00edslitelnost a slo\u017eitost I<\/em>. , 2002.
Doporu\u010den\u00e1:<\/strong> CHYTIL, MILAN Automaty a gramatiky<\/em>. Praha, SNTL, 1984. KU\u010cERA, L. Kombinatorick\u00e9 algoritmy<\/em>. Praha, SNTL, 1983.<\/td><\/tr><\/tbody><\/table><\/figure>\n","protected":false},"excerpt":{"rendered":"