{"id":18991,"date":"2008-07-15T09:21:12","date_gmt":"2008-07-15T09:21:12","guid":{"rendered":"https:\/\/www.upjs.sk\/prirodovedecka-fakulta\/studium\/dalsie-vzdelavanie\/predmety-rigoroznej-skusky-informatika\/"},"modified":"2022-10-26T08:12:39","modified_gmt":"2022-10-26T08:12:39","slug":"predmety-rigoroznej-skusky-informatika","status":"publish","type":"page","link":"https:\/\/www.upjs.sk\/prirodovedecka-fakulta\/studium\/dalsie-vzdelavanie\/predmety-rigoroznej-skusky-informatika\/","title":{"rendered":"Predmety rigor\u00f3znej sk\u00fa\u0161ky – Informatika"},"content":{"rendered":"

\"\" \"Zoznam <\/p>\n

<\/p>\n

\u0160tudijn\u00e9 predmety s\u00fa rozdelen\u00e9 do skupiny povinn\u00fdch a volite\u013en\u00fdch predmetov. Uch\u00e1dza\u010d si vyberie dva \u0161tudijn\u00e9 predmety, z ktor\u00fdch jeden mus\u00ed by\u0165 zo skupiny povinn\u00fdch predmetov a jeden zo skupiny volite\u013en\u00fdch predmetov.<\/p>\n

Povinn\u00e9 predmety<\/strong><\/p>\n

Automaty a form\u00e1lne jazyky<\/strong><\/p>\n

Chomsk\u00e9ho hierachia jazykov a gramat\u00edk. Kone\u010dnostavov\u00fd automat, a jeho varianty: deterministick\u00e9, nedeterministick\u00e9, alternuj\u00face, pravdepodobnostn\u00e9, kvantov\u00e9, at\u010f. Jednosmern\u00e9, dvojsmern\u00e9, obratovo ohrani\u010den\u00e9 kone\u010dnostavov\u00e9 automaty. Regul\u00e1rne v\u00fdrazy a gramatiky. Un\u00e1rne regul\u00e1rne jazyky a ich vlastnosti. Problematika kon\u0161trukcie efekt\u00edvnych automatov jednotliv\u00fdch typov, z h\u013eadiska po\u010dtu stavov a hr\u00e1n. S\u00favislosti medzi te\u00f3riou kone\u010dnostavov\u00fdch automatov a te\u00f3riou zlo\u017eitosti.\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0
Literat\u00fara:<\/strong>
J. E. Hopcroft, R. Motwani, J. D. Ullman, Introduction to automata theory, languages, and computation, Addison-Wesley, 2001.<\/p>\n

Datab\u00e1zov\u00e9 syst\u00e9my<\/strong>\u00a0\u00a0<\/p>\n

\u00davod\u00a0 (Hist\u00f3ria datab\u00e1zov\u00fdch technol\u00f3gi\u00ed, Hist\u00f3ria SQL, Princ\u00edpy datab\u00e1zov\u00fdch syst\u00e9mov a SQL). Pr\u00e1ca s jednou tabu\u013ekou\u00a0 (Vytvorenie a naplnenie tabu\u013eky. V\u00fdpisy v\u0161etk\u00fdch z\u00e1znamov a z\u00e1znamov sp\u013a\u0148aj\u00facich nejak\u00fa podmienku. Agrega\u010dn\u00e9 funkcie. Vnoren\u00e9 dopyty.\u00a0 Manipul\u00e1cia s d\u00e1tami tabu\u013eky. Prim\u00e1rny k\u013e\u00fa\u010d a \u010fal\u0161ie integritn\u00e9 obmedzenia). Pr\u00e1ca s viacer\u00fdmi tabu\u013ekami (Spojenie dvoch tabuliek. Cudz\u00ed k\u013e\u00fa\u010d. Modifik\u00e1cia \u0161trukt\u00fary tabu\u013eky. N\u00e1vrh v\u00e4\u010d\u0161ej datab\u00e1zovej \u0161trukt\u00fary. Mno\u017einov\u00e9 oper\u00e1cie. Ako postupova\u0165 pri kon\u0161trukcii dopytu?), \u010eal\u0161ie \u010drty SQL (Tranzit\u00edvny uz\u00e1ver a rekurzia. Poh\u013eady. Triggery. Indexy. Syst\u00e9mov\u00e9 tabu\u013eky. Z\u00e1klady administr\u00e1cie datab\u00e1zy. Spolupr\u00e1ca SQL a in\u00fdch jazykov). Teoretick\u00e9 z\u00e1klady datab\u00e1z (Formaliz\u00e1cia tabu\u013eky. Datab\u00e1zov\u00e1 logika. Rela\u010dn\u00e1 algebra. Funk\u010dn\u00e9 z\u00e1vislosti a norm\u00e1lne formy).
Literat\u00fara:<\/strong>\u00a0\u00a0
J. Ullman, Principles of database and knowledge \u2013 base systems, Comp. Sci. Press., 1988.<\/p>\n

V\u00fdpo\u010dtov\u00e1 zlo\u017eitos\u0165<\/strong><\/p>\n

Pojem nedeterministick\u00e9ho algoritmu pracuj\u00faceho v polynomi\u00e1lnom \u010dase, NP-\u00faplnos\u0165. Deterministick\u00e1 simul\u00e1cia nedeterministick\u00fdch Turingov\u00fdch strojov. Probl\u00e9m splnite\u013enosti boolovskej formuly. \u010eal\u0161ie NP-\u00fapln\u00e9 probl\u00e9my (splnite\u013enos\u0165 boolovskej formuly v konjunkt\u00edvnom norm\u00e1lnom tvare, 3-splnite\u013enos\u0165, 3-zafarbite\u013enos\u0165 grafu, 3-zafarbite\u013enos\u0165 plan\u00e1rneho grafu, plnenie ruksaku, vyva\u017eovanie …) Pam\u00e4\u0165ovo ohrani\u010den\u00e9 algoritmy, triedy LOG-space a P-space. Deterministick\u00e1 simul\u00e1cia (Savitchova veta). Uzavretos\u0165 na komplement (Immerman-Szelepcs\u00e9nyiho veta).\u00a0\u00a0
Literat\u00fara:\u00a0\u00a0 <\/strong>J.E. Hopcroft, R.Motwani, J.D. Ullman, Introduction to automata theory, languages, and computation, Addison-Wesley, 2001.\u00a0
\u00a0\u00a0\u00a0\u00a0\u00a0
Algoritmy a \u0161trukt\u00fary \u00fadajov<\/strong>\u00a0<\/p>\n

Algoritmick\u00fd probl\u00e9m a jeho rie\u0161enie. Spr\u00e1vnos\u0165 algoritmu a testovanie algoritmov. Vlastnosti programovac\u00edch jazykov vy\u0161\u0161ieho typu. Zlo\u017eitos\u0165 algoritmov. Rekurzia, met\u00f3da s n\u00e1vratom (backtracking). Algoritmick\u00fd probl\u00e9m triedenia, algoritmy a zlo\u017eitos\u0165. D\u00f4le\u017eit\u00e9 \u00fadajov\u00e9 \u0161trukt\u00fary – z\u00e1sobn\u00edk, rad, graf. Algoritmy na grafoch.
Literat\u00fara: <\/strong>1. N. Wirth, Algorithms+Data Structures=Programs, Prentice-Hall, 1976, ex. slovensk\u00fd preklad v roku 1987.\u00a0\u00a0\u00a0\u00a0
2. P. Toepfer,\u00a0 Algoritmy a\u00a0 programovac\u00ed techniky,\u00a0 Prometheus, Praha, 1995.<\/p>\n

Logika\u00a0 <\/strong><\/p>\n

V\u00fdrokov\u00fd a predik\u00e1tov\u00fd po\u010det, korektnos\u0165 a \u00faplnos\u0165, norm\u00e1lne formy, vz\u0165ah k rela\u010dn\u00fdm datab\u00e1zam, kompaktnos\u0165.
Literat\u00fara:<\/strong>
M.Ben-Ari, Mathematical logic for Computer Science 2ed. Springer Verlag London 2001<\/p>\n

Te\u00f3ria algoritmov a vypo\u010d\u00edtate\u013enosti<\/strong><\/p>\n

Turingov stroj ako formaliz\u00e1cia pojmu algoritmus. \u010ciasto\u010dne rekurz\u00edvne funkcie. Kleeneho veta o norm\u00e1lnom tvare. Vz\u0165ah funkci\u00ed vypo\u010d\u00edtate\u013en\u00fdch na Turingovom stroji a \u010diasto\u010dne rekurz\u00edvnych funkci\u00ed. Probl\u00e9m zastavenia sa Turingovho stroja. Vlastnosti rekurz\u00edvne o\u010d\u00edslovate\u013en\u00fdch mno\u017e\u00edn. Univerz\u00e1lny syst\u00e9m programov. Veta o preklade, Riceova veta. Dynamick\u00e1 miera zlo\u017eitosti, pr\u00edklady. Veta o medzere, vz\u0165ah hodnoty funkcie a dynamickej miery zlo\u017eitosti.
Literat\u00fara:<\/strong>\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0
1. L. Bukovsk\u00fd, Te\u00f3ria algoritmov, ES UPJ\u0160, Ko\u0161ice 2004.
2. S. Bridges S, Computability: A mathematical Sketchbook, Springer 1994.<\/p>\n

Volite\u013en\u00e9 predmety<\/strong><\/p>\n

Po\u010d\u00edta\u010dov\u00e9 syst\u00e9my a siete<\/strong><\/p>\n

Princ\u00edpy \u010dinnosti procesora, strojov\u00e9 in\u0161trukcie a ich vykon\u00e1vanie. Komunik\u00e1cia procesora s okol\u00edm. Radi\u010de zariaden\u00ed a funkcie ovl\u00e1da\u010dov. \u0160trukt\u00fara a funkcie opera\u010dn\u00e9ho syst\u00e9mu. Vytv\u00e1ranie obrazu \u00falohy a jej vykonanie. Proces, spr\u00e1va procesov, komunik\u00e1cia, klasick\u00e9 synchroniza\u010dn\u00e9 probl\u00e9my, pride\u013eovanie procesora. Spr\u00e1va pam\u00e4te, segment\u00e1cia, str\u00e1nkovanie, virtu\u00e1lna pam\u00e4\u0165. S\u00faborov\u00e9 syst\u00e9my, adres\u00e1re, bezpe\u010dnos\u0165 a ochrana pr\u00edstupov\u00fdmi pr\u00e1vami. Riadenie vstupno-v\u00fdstupn\u00fdch zariaden\u00ed, pride\u013eovanie zdrojov, uviaznutie. Termin\u00e1lov\u00e9 siete, s\u00faborov\u00e9 a hostite\u013esk\u00e9 servery, mapovanie a presmerovanie. Sie\u0165ov\u00e9 a distribuovan\u00e9 opera\u010dn\u00e9 syst\u00e9my, middleware. Vrstvov\u00fd ISO OSI referen\u010dn\u00fd model. Charakteristiky prenosov\u00fdch kan\u00e1lov, teoretick\u00e9 ohrani\u010denia prenosu sign\u00e1lu, prenosov\u00e9 techniky. Pr\u00edstupov\u00e9 met\u00f3dy CSMA\/CD, Token Ring, vysokor\u00fdchlostn\u00e9 siete. Prep\u00e1janie siet\u00ed, opakova\u010de, mosty, smerova\u010de. Sie\u0165ov\u00e1 vrstva v sie\u0165ach TCP\/IP, adresov\u00e1 \u0161trukt\u00fara, ARP, ES-IS komunik\u00e1cia. Protokol IP, ICMP riadenie, spojovan\u00e9 a bezspojov\u00e9 transportn\u00e9 protokoly TCP a UDP. Aplika\u010dn\u00e9 protokoly Telnet, FTP, SMTP, SNMP, syst\u00e9m dom\u00e9nov\u00fdch mien DNS, tvorba sie\u0165ov\u00fdch a distribuovan\u00fdch aplik\u00e1ci\u00ed.
Literat\u00fara:<\/strong>
1. A. Silberschatz, G. Gagne, P. Baer, Operating System Concepts, Wiley, 2002.
2. A.S. Tanenbaum, Computer Networks, Prentice Hall, 2002.<\/p>\n

Paraleln\u00e9 a distribuovan\u00e9 syst\u00e9my<\/strong><\/p>\n

Paraleln\u00e9 architekt\u00fary, paraleln\u00fd v\u00fdpo\u010dtov\u00fd model. Strat\u00e9gie rozlo\u017eenia z\u00e1\u0165a\u017ee, zre\u0165azen\u00e9 v\u00fdpo\u010dty, synchroniz\u00e1cia, detekcia ukon\u010denia. Programovanie so zdie\u013eanou pam\u00e4\u0165ou, vl\u00e1kna. \u0160k\u00e1lovate\u013enos\u0165 paraleln\u00fdch programov, z\u00e1kladn\u00e9 programovacie\u00a0 techniky. Distribuovan\u00fd v\u00fdpo\u010dtov\u00fd model, komunika\u010dn\u00e9 protokoly, charakteristika distribuovan\u00fdch syst\u00e9mov. Medzipo\u010d\u00edta\u010dov\u00e1 komunik\u00e1cia, distribuovan\u00e9 synchroniza\u010dn\u00e9 algoritmy, transakcie, detekcia ukon\u010denia a uviaznutia. Procesy v distribuovanom prostred\u00ed, vl\u00e1kna, migr\u00e1cia, vyva\u017eovanie z\u00e1\u0165a\u017ee, syst\u00e9mov\u00e9 chyby. Distribovan\u00e9 s\u00faborov\u00e9 syst\u00e9my, replik\u00e1cia, spr\u00e1va mien. Probl\u00e9my konzistencie pri distribuovanom zdie\u013ean\u00ed pam\u00e4te. Objektovo orientovan\u00e9 nadstavby a aplika\u010dn\u00e9 prostredia. Ochrana a bezpe\u010dnos\u0165 distribuovanej komunik\u00e1cie.
Literat\u00fara:<\/strong>\u00a0
A.S. Tanenbaum, M. van Steen, Distributed Systems – Principles and Paradigms, Prentice Hall, 2002.
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0
Deduktivne znalostne systemy<\/strong>\u00a0<\/p>\n

Model logick\u00e9ho programovania a Datalog-u \u2013 vypo\u010d\u00edtan\u00e1 a spr\u00e1vna odpove\u010f, korektnos\u0165 a \u00faplnos\u0165, fixpoint, roz\u0161\u00edrenia pre viachodnotov\u00e9 logiky, vz\u0165ah k SQL, r\u00f4zne strat\u00e9gie h\u013eadania najlep\u0161ej odpovede.
Literat\u00fara: <\/strong>J. Ullman, Principles of database and knowledge based systems. Comp. Sci. Press 1988.<\/p>\n

Z\u00edskavanie inform\u00e1ci\u00ed a indukt\u00edvne logick\u00e9 programovanie<\/strong>\u00a0<\/p>\n

Z\u00e1kladn\u00e9 modely (formul\u00e1cie \u00faloh) a algoritmy indukt\u00edvneho logick\u00e9ho programovania, roz\u0161\u00edrenie pre viachodnotov\u00e9 logiky a monot\u00f3nnu klasifik\u00e1ciu, porovnanie s asocia\u010dn\u00fdmi pravidlami, apriori algoritmom, klasifika\u010dn\u00fdmi a regresn\u00fdmi stromami.
Literat\u00fara:<\/strong>
J. B. Paris, The uncertain Reasoners Companion. Cambridge University Press, 1994.<\/p>\n

Informa\u010dn\u00e9 syst\u00e9my<\/strong><\/p>\n

Syst\u00e9m, \u017eivotn\u00fd cyklus IS, \u017eivotn\u00fd cyklus v\u00fdvoja IS. Vizu\u00e1lne modelovanie, metodol\u00f3gie, CASE n\u00e1stroje. UML. Riadenie projektu, dokument\u00e1cia projektu a \u00fadr\u017eba dokument\u00e1cie.
Literat\u00fara:<\/strong>\u00a0\u00a0
Rumbaugh J., Blaha M., Premerlani W., Eddy F., Lorensen W., Object-Oriented Modeling and Design, Prentice Hall 1991.
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0
Kryptografia a bezpe\u010dnos\u0165 informa\u010dn\u00fdch syst\u00e9mov<\/strong>\u00a0<\/p>\n

Kryptografick\u00e9 modely, konven\u010dn\u00e1 symetrick\u00e1 kryptografia, met\u00f3dy a mo\u017enosti kryptoanal\u00fdzy. Asymetrick\u00e9 kryptografick\u00e9 syst\u00e9my, autentifik\u00e1cia, ha\u0161ovacie funkcie a syst\u00e9my elektronick\u00e9ho podpisu. Generovanie a distrib\u00facia k\u013e\u00fa\u010dov, autentifika\u010dn\u00e9 protokoly a ich zranite\u013enos\u0165. Certifik\u00e1cia, bezpe\u010dn\u00e9 elektronick\u00e9 platobn\u00e9 syst\u00e9my. Mechanizmy zabezpe\u010denia IS, syst\u00e9mov\u00e9 a sie\u0165ov\u00e9 bezpe-\u010dnostn\u00e9 hrozby. Bezpe\u010dnostn\u00e1 politika, anal\u00fdza riz\u00edk, krit\u00e9ri\u00e1 hodnotenia bezpe\u010dnosti informa\u010dn\u00fdch syst\u00e9mov. Bezpe\u010dnostn\u00e9 hrozby v jednotliv\u00fdch vrstv\u00e1ch siete Internet, filtre, bezpe\u010dnostn\u00e9 br\u00e1ny a z\u00e1stupn\u00e9 servery. Rie\u0161enie bezpe\u010dnosti v sieti Internet, protokoly SSL, IPSec.
Literat\u00fara:<\/strong>\u00a0
D. R. Stinson, Cryptography. Theory and Practie, CRC Press, 2002.\u00a0\u00a0
\u00a0\u00a0\u00a0
Po\u010d\u00edta\u010dov\u00e1 grafika<\/strong>\u00a0<\/p>\n

Technick\u00e9 prostriedky po\u010d\u00edta\u010dovej grafiky, farebn\u00e9 modely, met\u00f3dy k\u00f3dovania obrazu. R\u00fdchle pr\u00edrastkov\u00e9 algoritmy pre kresbu \u00fase\u010diek, kru\u017en\u00edc, polyn\u00f3mov. Vypl\u0148ovanie oblast\u00ed, orez\u00e1vanie. Modelovanie kriviek, Fergusonova interpol\u00e1cia, spline krivky, B\u00e9zierove a B-spline krivky, modelovanie pl\u00f4ch. Homog\u00e9nne s\u00faradnice, transform\u00e1cie v rovine a priestore, stredov\u00e9 a rovnobe\u017en\u00e9 premietanie. Ur\u010dovanie vidite\u013enosti, osvet\u013eovacie modely, tie\u0148ovanie. Realistick\u00e9 zobrazovanie, text\u00fary, sledovanie l\u00fa\u010da, vy\u017earovacia met\u00f3da. Reprezent\u00e1cie \u00fadajov, popis sc\u00e9ny, zobrazovac\u00ed re\u0165azec, postupy po\u010d\u00edta\u010dovej anim\u00e1cie, virtu\u00e1lna realita.
Literat\u00fara:<\/strong>\u00a0\u00a0
J. \u017d\u00e1ra, B. Bene\u0161, P. Felkel, Modern\u00ed po\u010d\u00edta\u010dov\u00e1 grafika, Computer Press, 1998.\u00a0\u00a0\u00a0\u00a0
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0
Neur\u00f3nov\u00e9 siete<\/strong><\/p>\n

Modely dopredn\u00fdch a rekurentn\u00fdch neur\u00f3nov\u00fdch siet\u00ed, back-propagation algoritmus pre adapt\u00e1ciu siet\u00ed, schopnos\u0165 neur\u00f3nov\u00fdch siet\u00ed by\u0165 univerz\u00e1lnym aproxim\u00e1torom. Hopfieldova neur\u00f3nov\u00e1 sie\u0165 a rie\u0161enie optimaliz\u00e1\u010dnych \u00faloh. Kohonenove neur\u00f3nov\u00e9 siete. Neur\u00f3nov\u00e9 siete vo vz\u0165ahu k in\u00fdm v\u00fdpo\u010dtov\u00fdm modelom. Teoretick\u00e9 probl\u00e9my v oblasti neur\u00f3nov\u00fdvh siet\u00ed.
Literat\u00fara: <\/strong>J. \u0160\u00edma, R. Neruda, Teoretick\u00e9 ot\u00e1zky neur\u00f3nov\u00fdch s\u00edt\u00ed. Matfyzpress,MFF UK, Praha, 1996.<\/p>\n

Te\u00f3ria v\u00fdpo\u010dtov\u00e9ho u\u010denia<\/strong><\/p>\n

U\u010diace algoritmy, koncepcie, hypot\u00e9zy. Booleovsk\u00e9 formuly a ich reprezent\u00e1cia. Pravdepodobnostn\u00e9 u\u010denie, konzistentn\u00e9 algoritmy a u\u010denie, efekt\u00edvne u\u010denie, redukovatelnos\u0165 v PAC u\u010den\u00ed, u\u010denie kone\u010dn\u00fdch automatov pomocou experimentov. U\u010denie v neur\u00f3nov\u00fdch sie\u0165ach.
Literat\u00fara:<\/strong>
M. Anthony, N. Biggs, Computational Learning Theory, Cambridge University Press, 1991, 1999.<\/p>\n

Te\u00f3ria vyu\u010dovania informatiky<\/strong><\/p>\n

Cie\u013e, obsah a didaktick\u00e9 prostriedky vyu\u010dovania \u0161kolskej informatiky. Pojmotvorn\u00fd proces v \u0161kolskej informatike. \u00davod do metodol\u00f3gie pedagogick\u00e9ho v\u00fdskumu v \u0161kolskej informatike. Stanovovanie u\u010debn\u00fdch cie\u013eov. Maturitn\u00fd \u0161tandard z informatiky. Postavenie \u00faloh v \u0161kolskej informatike, didaktick\u00e9 funkcie a formul\u00e1cie \u00faloh, tvorba syst\u00e9mov \u00faloh. Hodnotenie \u017eiackych v\u00fdkonov, didaktick\u00e9 testy. Tvorba didaktick\u00fdch projektov. V\u00fdu\u010dba \u0161trukt\u00farovan\u00e9ho a objektov\u00e9ho programovania. Aritmetika po\u010d\u00edta\u010da. Matematick\u00e9 modelovanie a simul\u00e1cie. V\u00fdu\u010dba tematick\u00fdch oblast\u00ed: Inform\u00e1cie okolo n\u00e1s, Po\u010d\u00edta\u010dov\u00e9 syst\u00e9my, Informa\u010dn\u00e1 spolo\u010dnos\u0165, Oblasti vyu\u017eitia informatiky (kancel\u00e1rsky bal\u00edk, Internet, multim\u00e9di\u00e1).
Literat\u00fara:<\/strong>
Kala\u0161, I. a kol., Informatika pre stredn\u00e9 \u0161koly, SPN, Bratislava, 2001.<\/p>\n","protected":false},"excerpt":{"rendered":"

\u0160tudijn\u00e9 predmety s\u00fa rozdelen\u00e9 do skupiny povinn\u00fdch a volite\u013en\u00fdch predmetov. Uch\u00e1dza\u010d si vyberie dva \u0161tudijn\u00e9 predmety, z ktor\u00fdch jeden mus\u00ed by\u0165 zo skupiny povinn\u00fdch predmetov a jeden zo skupiny volite\u013en\u00fdch predmetov. Povinn\u00e9 predmety Automaty a form\u00e1lne jazyky Chomsk\u00e9ho hierachia jazykov a gramat\u00edk. Kone\u010dnostavov\u00fd automat, a jeho varianty: deterministick\u00e9, nedeterministick\u00e9, alternuj\u00face, pravdepodobnostn\u00e9, kvantov\u00e9, at\u010f. Jednosmern\u00e9, dvojsmern\u00e9, … \u010c\u00edta\u0165 \u010falej<\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"parent":17187,"menu_order":4,"comment_status":"closed","ping_status":"closed","template":"","meta":{"_editorskit_title_hidden":false,"_editorskit_reading_time":0,"_editorskit_is_block_options_detached":false,"_editorskit_block_options_position":"{}","footnotes":""},"acf":{"acf_link_na_externy_obsah":""},"yoast_head":"\nPredmety rigor\u00f3znej sk\u00fa\u0161ky - Informatika - Pr\u00edrodovedeck\u00e1 fakulta | UPJ\u0160<\/title>\n<meta name=\"robots\" content=\"index, follow, max-snippet:-1, max-image-preview:large, max-video-preview:-1\" \/>\n<link rel=\"canonical\" href=\"https:\/\/www.upjs.sk\/prirodovedecka-fakulta\/studium\/dalsie-vzdelavanie\/predmety-rigoroznej-skusky-informatika\/\" \/>\n<meta property=\"og:locale\" content=\"sk_SK\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"Predmety rigor\u00f3znej sk\u00fa\u0161ky - Informatika - Pr\u00edrodovedeck\u00e1 fakulta | UPJ\u0160\" \/>\n<meta property=\"og:description\" content=\"\u0160tudijn\u00e9 predmety s\u00fa rozdelen\u00e9 do skupiny povinn\u00fdch a volite\u013en\u00fdch predmetov. Uch\u00e1dza\u010d si vyberie dva \u0161tudijn\u00e9 predmety, z ktor\u00fdch jeden mus\u00ed by\u0165 zo skupiny povinn\u00fdch predmetov a jeden zo skupiny volite\u013en\u00fdch predmetov. Povinn\u00e9 predmety Automaty a form\u00e1lne jazyky Chomsk\u00e9ho hierachia jazykov a gramat\u00edk. Kone\u010dnostavov\u00fd automat, a jeho varianty: deterministick\u00e9, nedeterministick\u00e9, alternuj\u00face, pravdepodobnostn\u00e9, kvantov\u00e9, at\u010f. Jednosmern\u00e9, dvojsmern\u00e9, … \u010c\u00edta\u0165 \u010falej\" \/>\n<meta property=\"og:url\" content=\"https:\/\/www.upjs.sk\/prirodovedecka-fakulta\/studium\/dalsie-vzdelavanie\/predmety-rigoroznej-skusky-informatika\/\" \/>\n<meta property=\"og:site_name\" content=\"Pr\u00edrodovedeck\u00e1 fakulta | UPJ\u0160\" \/>\n<meta property=\"article:modified_time\" content=\"2022-10-26T08:12:39+00:00\" \/>\n<meta property=\"og:image\" content=\"http:\/\/www.science.upjs.sk\/pic\/science\/h1.gif\" \/>\n<meta name=\"twitter:card\" content=\"summary_large_image\" \/>\n<meta name=\"twitter:label1\" content=\"Predpokladan\u00fd \u010das \u010d\u00edtania\" \/>\n\t<meta name=\"twitter:data1\" content=\"8 min\u00fat\" \/>\n<script type=\"application\/ld+json\" class=\"yoast-schema-graph\">{\"@context\":\"https:\/\/schema.org\",\"@graph\":[{\"@type\":\"WebPage\",\"@id\":\"https:\/\/www.upjs.sk\/prirodovedecka-fakulta\/studium\/dalsie-vzdelavanie\/predmety-rigoroznej-skusky-informatika\/\",\"url\":\"https:\/\/www.upjs.sk\/prirodovedecka-fakulta\/studium\/dalsie-vzdelavanie\/predmety-rigoroznej-skusky-informatika\/\",\"name\":\"Predmety rigor\u00f3znej sk\u00fa\u0161ky - Informatika - Pr\u00edrodovedeck\u00e1 fakulta | UPJ\u0160\",\"isPartOf\":{\"@id\":\"https:\/\/www.upjs.sk\/prirodovedecka-fakulta\/#website\"},\"primaryImageOfPage\":{\"@id\":\"https:\/\/www.upjs.sk\/prirodovedecka-fakulta\/studium\/dalsie-vzdelavanie\/predmety-rigoroznej-skusky-informatika\/#primaryimage\"},\"image\":{\"@id\":\"https:\/\/www.upjs.sk\/prirodovedecka-fakulta\/studium\/dalsie-vzdelavanie\/predmety-rigoroznej-skusky-informatika\/#primaryimage\"},\"thumbnailUrl\":\"http:\/\/www.science.upjs.sk\/pic\/science\/h1.gif\",\"datePublished\":\"2008-07-15T09:21:12+00:00\",\"dateModified\":\"2022-10-26T08:12:39+00:00\",\"breadcrumb\":{\"@id\":\"https:\/\/www.upjs.sk\/prirodovedecka-fakulta\/studium\/dalsie-vzdelavanie\/predmety-rigoroznej-skusky-informatika\/#breadcrumb\"},\"inLanguage\":\"sk-SK\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\/\/www.upjs.sk\/prirodovedecka-fakulta\/studium\/dalsie-vzdelavanie\/predmety-rigoroznej-skusky-informatika\/\"]}]},{\"@type\":\"ImageObject\",\"inLanguage\":\"sk-SK\",\"@id\":\"https:\/\/www.upjs.sk\/prirodovedecka-fakulta\/studium\/dalsie-vzdelavanie\/predmety-rigoroznej-skusky-informatika\/#primaryimage\",\"url\":\"http:\/\/www.science.upjs.sk\/pic\/science\/h1.gif\",\"contentUrl\":\"http:\/\/www.science.upjs.sk\/pic\/science\/h1.gif\"},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\/\/www.upjs.sk\/prirodovedecka-fakulta\/studium\/dalsie-vzdelavanie\/predmety-rigoroznej-skusky-informatika\/#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"Home\",\"item\":\"https:\/\/www.upjs.sk\/prirodovedecka-fakulta\/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"O \u0161t\u00fadiu na fakulte\",\"item\":\"https:\/\/www.upjs.sk\/prirodovedecka-fakulta\/studium\/\"},{\"@type\":\"ListItem\",\"position\":3,\"name\":\"\u010eal\u0161ie vzdel\u00e1vanie\",\"item\":\"https:\/\/www.upjs.sk\/prirodovedecka-fakulta\/?page_id=17187\"},{\"@type\":\"ListItem\",\"position\":4,\"name\":\"Predmety rigor\u00f3znej sk\u00fa\u0161ky – Informatika\"}]},{\"@type\":\"WebSite\",\"@id\":\"https:\/\/www.upjs.sk\/prirodovedecka-fakulta\/#website\",\"url\":\"https:\/\/www.upjs.sk\/prirodovedecka-fakulta\/\",\"name\":\"Pr\u00edrodovedeck\u00e1 fakulta | UPJ\u0160\",\"description\":\"\",\"publisher\":{\"@id\":\"https:\/\/www.upjs.sk\/prirodovedecka-fakulta\/#organization\"},\"potentialAction\":[{\"@type\":\"SearchAction\",\"target\":{\"@type\":\"EntryPoint\",\"urlTemplate\":\"https:\/\/www.upjs.sk\/prirodovedecka-fakulta\/?s={search_term_string}\"},\"query-input\":\"required name=search_term_string\"}],\"inLanguage\":\"sk-SK\"},{\"@type\":\"Organization\",\"@id\":\"https:\/\/www.upjs.sk\/prirodovedecka-fakulta\/#organization\",\"name\":\"Pr\u00edrodovedeck\u00e1 fakulta | UPJ\u0160\",\"url\":\"https:\/\/www.upjs.sk\/prirodovedecka-fakulta\/\",\"logo\":{\"@type\":\"ImageObject\",\"inLanguage\":\"sk-SK\",\"@id\":\"https:\/\/www.upjs.sk\/prirodovedecka-fakulta\/#\/schema\/logo\/image\/\",\"url\":\"https:\/\/www.upjs.sk\/app\/uploads\/sites\/10\/2022\/09\/logo-prirodovedecka-fakulta.png\",\"contentUrl\":\"https:\/\/www.upjs.sk\/app\/uploads\/sites\/10\/2022\/09\/logo-prirodovedecka-fakulta.png\",\"width\":415,\"height\":87,\"caption\":\"Pr\u00edrodovedeck\u00e1 fakulta | UPJ\u0160\"},\"image\":{\"@id\":\"https:\/\/www.upjs.sk\/prirodovedecka-fakulta\/#\/schema\/logo\/image\/\"}}]}<\/script>\n<!-- \/ Yoast SEO plugin. -->","yoast_head_json":{"title":"Predmety rigor\u00f3znej sk\u00fa\u0161ky - Informatika - Pr\u00edrodovedeck\u00e1 fakulta | UPJ\u0160","robots":{"index":"index","follow":"follow","max-snippet":"max-snippet:-1","max-image-preview":"max-image-preview:large","max-video-preview":"max-video-preview:-1"},"canonical":"https:\/\/www.upjs.sk\/prirodovedecka-fakulta\/studium\/dalsie-vzdelavanie\/predmety-rigoroznej-skusky-informatika\/","og_locale":"sk_SK","og_type":"article","og_title":"Predmety rigor\u00f3znej sk\u00fa\u0161ky - Informatika - Pr\u00edrodovedeck\u00e1 fakulta | UPJ\u0160","og_description":"\u0160tudijn\u00e9 predmety s\u00fa rozdelen\u00e9 do skupiny povinn\u00fdch a volite\u013en\u00fdch predmetov. Uch\u00e1dza\u010d si vyberie dva \u0161tudijn\u00e9 predmety, z ktor\u00fdch jeden mus\u00ed by\u0165 zo skupiny povinn\u00fdch predmetov a jeden zo skupiny volite\u013en\u00fdch predmetov. Povinn\u00e9 predmety Automaty a form\u00e1lne jazyky Chomsk\u00e9ho hierachia jazykov a gramat\u00edk. Kone\u010dnostavov\u00fd automat, a jeho varianty: deterministick\u00e9, nedeterministick\u00e9, alternuj\u00face, pravdepodobnostn\u00e9, kvantov\u00e9, at\u010f. Jednosmern\u00e9, dvojsmern\u00e9, … \u010c\u00edta\u0165 \u010falej","og_url":"https:\/\/www.upjs.sk\/prirodovedecka-fakulta\/studium\/dalsie-vzdelavanie\/predmety-rigoroznej-skusky-informatika\/","og_site_name":"Pr\u00edrodovedeck\u00e1 fakulta | UPJ\u0160","article_modified_time":"2022-10-26T08:12:39+00:00","og_image":[{"url":"http:\/\/www.science.upjs.sk\/pic\/science\/h1.gif"}],"twitter_card":"summary_large_image","twitter_misc":{"Predpokladan\u00fd \u010das \u010d\u00edtania":"8 min\u00fat"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"WebPage","@id":"https:\/\/www.upjs.sk\/prirodovedecka-fakulta\/studium\/dalsie-vzdelavanie\/predmety-rigoroznej-skusky-informatika\/","url":"https:\/\/www.upjs.sk\/prirodovedecka-fakulta\/studium\/dalsie-vzdelavanie\/predmety-rigoroznej-skusky-informatika\/","name":"Predmety rigor\u00f3znej sk\u00fa\u0161ky - Informatika - Pr\u00edrodovedeck\u00e1 fakulta | UPJ\u0160","isPartOf":{"@id":"https:\/\/www.upjs.sk\/prirodovedecka-fakulta\/#website"},"primaryImageOfPage":{"@id":"https:\/\/www.upjs.sk\/prirodovedecka-fakulta\/studium\/dalsie-vzdelavanie\/predmety-rigoroznej-skusky-informatika\/#primaryimage"},"image":{"@id":"https:\/\/www.upjs.sk\/prirodovedecka-fakulta\/studium\/dalsie-vzdelavanie\/predmety-rigoroznej-skusky-informatika\/#primaryimage"},"thumbnailUrl":"http:\/\/www.science.upjs.sk\/pic\/science\/h1.gif","datePublished":"2008-07-15T09:21:12+00:00","dateModified":"2022-10-26T08:12:39+00:00","breadcrumb":{"@id":"https:\/\/www.upjs.sk\/prirodovedecka-fakulta\/studium\/dalsie-vzdelavanie\/predmety-rigoroznej-skusky-informatika\/#breadcrumb"},"inLanguage":"sk-SK","potentialAction":[{"@type":"ReadAction","target":["https:\/\/www.upjs.sk\/prirodovedecka-fakulta\/studium\/dalsie-vzdelavanie\/predmety-rigoroznej-skusky-informatika\/"]}]},{"@type":"ImageObject","inLanguage":"sk-SK","@id":"https:\/\/www.upjs.sk\/prirodovedecka-fakulta\/studium\/dalsie-vzdelavanie\/predmety-rigoroznej-skusky-informatika\/#primaryimage","url":"http:\/\/www.science.upjs.sk\/pic\/science\/h1.gif","contentUrl":"http:\/\/www.science.upjs.sk\/pic\/science\/h1.gif"},{"@type":"BreadcrumbList","@id":"https:\/\/www.upjs.sk\/prirodovedecka-fakulta\/studium\/dalsie-vzdelavanie\/predmety-rigoroznej-skusky-informatika\/#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"Home","item":"https:\/\/www.upjs.sk\/prirodovedecka-fakulta\/"},{"@type":"ListItem","position":2,"name":"O \u0161t\u00fadiu na fakulte","item":"https:\/\/www.upjs.sk\/prirodovedecka-fakulta\/studium\/"},{"@type":"ListItem","position":3,"name":"\u010eal\u0161ie vzdel\u00e1vanie","item":"https:\/\/www.upjs.sk\/prirodovedecka-fakulta\/?page_id=17187"},{"@type":"ListItem","position":4,"name":"Predmety rigor\u00f3znej sk\u00fa\u0161ky – Informatika"}]},{"@type":"WebSite","@id":"https:\/\/www.upjs.sk\/prirodovedecka-fakulta\/#website","url":"https:\/\/www.upjs.sk\/prirodovedecka-fakulta\/","name":"Pr\u00edrodovedeck\u00e1 fakulta | UPJ\u0160","description":"","publisher":{"@id":"https:\/\/www.upjs.sk\/prirodovedecka-fakulta\/#organization"},"potentialAction":[{"@type":"SearchAction","target":{"@type":"EntryPoint","urlTemplate":"https:\/\/www.upjs.sk\/prirodovedecka-fakulta\/?s={search_term_string}"},"query-input":"required name=search_term_string"}],"inLanguage":"sk-SK"},{"@type":"Organization","@id":"https:\/\/www.upjs.sk\/prirodovedecka-fakulta\/#organization","name":"Pr\u00edrodovedeck\u00e1 fakulta | UPJ\u0160","url":"https:\/\/www.upjs.sk\/prirodovedecka-fakulta\/","logo":{"@type":"ImageObject","inLanguage":"sk-SK","@id":"https:\/\/www.upjs.sk\/prirodovedecka-fakulta\/#\/schema\/logo\/image\/","url":"https:\/\/www.upjs.sk\/app\/uploads\/sites\/10\/2022\/09\/logo-prirodovedecka-fakulta.png","contentUrl":"https:\/\/www.upjs.sk\/app\/uploads\/sites\/10\/2022\/09\/logo-prirodovedecka-fakulta.png","width":415,"height":87,"caption":"Pr\u00edrodovedeck\u00e1 fakulta | UPJ\u0160"},"image":{"@id":"https:\/\/www.upjs.sk\/prirodovedecka-fakulta\/#\/schema\/logo\/image\/"}}]}},"_links":{"self":[{"href":"https:\/\/www.upjs.sk\/prirodovedecka-fakulta\/wp-json\/wp\/v2\/pages\/18991"}],"collection":[{"href":"https:\/\/www.upjs.sk\/prirodovedecka-fakulta\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/www.upjs.sk\/prirodovedecka-fakulta\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/www.upjs.sk\/prirodovedecka-fakulta\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.upjs.sk\/prirodovedecka-fakulta\/wp-json\/wp\/v2\/comments?post=18991"}],"version-history":[{"count":1,"href":"https:\/\/www.upjs.sk\/prirodovedecka-fakulta\/wp-json\/wp\/v2\/pages\/18991\/revisions"}],"predecessor-version":[{"id":18992,"href":"https:\/\/www.upjs.sk\/prirodovedecka-fakulta\/wp-json\/wp\/v2\/pages\/18991\/revisions\/18992"}],"up":[{"embeddable":true,"href":"https:\/\/www.upjs.sk\/prirodovedecka-fakulta\/wp-json\/wp\/v2\/pages\/17187"}],"wp:attachment":[{"href":"https:\/\/www.upjs.sk\/prirodovedecka-fakulta\/wp-json\/wp\/v2\/media?parent=18991"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}