Jde o jednooborov\u00e9 studium u\u010ditelstv\u00ed\u00a0pouze informatiky (navazuj\u00edc\u00ed na obor ITA).<\/p>\n
Uchaze\u010d\u016fm, kte\u0159\u00ed JSOU ABSOLVENTY<\/strong> bc. programu Asistent se zam\u011b\u0159en\u00edm na vzd\u011bl\u00e1v\u00e1n\u00ed a informatiku<\/em>\u00a0nebo<\/strong> Informa\u010dn\u00ed technologie a e-learning<\/em> na Pedagogick\u00e9 fakult\u011b JU, je p\u0159ij\u00edmac\u00ed zkou\u0161ka z\u00a0informatiky prominuta<\/strong>.<\/p>\n Uchaze\u010di, kte\u0159\u00ed NEJSOU ABSOLVENTY<\/b> \u017e\u00e1dn\u00e9ho z <\/span>t<\/span>\u011bchto program\u016f<\/span>, konaj\u00ed do navazuj\u00edc\u00edho studia \u00fastn\u00ed p\u0159ij\u00edmac\u00ed zkou\u0161ku<\/strong> z\u00a0informatiky.<\/p>\n <\/p>\n Uchaze\u010d dostane dv\u011b ot\u00e1zky: jednu teoretickou ot\u00e1zku a jednu praktickou \u00falohu.<\/p>\n Na teoretickou ot\u00e1zku uchaze\u010d odpov\u00edd\u00e1 \u00fastn\u011b. Praktickou \u00falohu vy\u0159e\u0161\u00ed p\u0159i p\u0159\u00edprav\u011b \u201ena pot\u00edtku“ a p\u0159ed komis\u00ed obh\u00e1j\u00ed jej\u00ed \u0159e\u0161en\u00ed.<\/p>\n 1. Opera\u010dn\u00ed syst\u00e9m<\/strong> 1. Mno\u017estv\u00ed informace ve zpr\u00e1v\u011b, reprezentace \u010d\u00edsel a znak\u016f v po\u010d\u00edta\u010di<\/strong> Seznam ani zn\u011bn\u00ed praktick\u00fdch \u00faloh nen\u00ed uchaze\u010d\u016fm p\u0159edem zn\u00e1m. Praktick\u00e1 probl\u00e9mov\u00e1 \u00faloha je komis\u00ed p\u0159id\u011blena.<\/p>\n P\u0159ehled uk\u00e1zkov\u00fdch praktick\u00fdch \u00faloh je ke sta\u017een\u00ed dole<\/strong>. Nejde ov\u0161em o jejich seznam ani v\u00fdb\u011br z t\u011bchto \u00faloh, pouze o uk\u00e1zky, jak takov\u00e9 \u00falohy mohou vypadat. Vystaven\u00e9 \u00falohy jsou vybr\u00e1ny ze st\u00e1tnicov\u00fdch praktick\u00fdch \u00faloh\u00a0oboru Informa\u010dn\u00ed technologie a e-learning.<\/em><\/p>\n","protected":false},"excerpt":{"rendered":" Jde o jednooborov\u00e9 studium u\u010ditelstv\u00ed\u00a0pouze informatiky (navazuj\u00edc\u00ed na obor ITA). P\u0159ij\u00edmac\u00ed zkou\u0161ka Uchaze\u010d\u016fm, kte\u0159\u00ed JSOU ABSOLVENTY bc. programu Asistent se…<\/p>\n","protected":false},"author":8,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"class_list":["post-837","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/katedry.pf.jcu.cz\/kin\/wp-json\/wp\/v2\/pages\/837","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/katedry.pf.jcu.cz\/kin\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/katedry.pf.jcu.cz\/kin\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/katedry.pf.jcu.cz\/kin\/wp-json\/wp\/v2\/users\/8"}],"replies":[{"embeddable":true,"href":"https:\/\/katedry.pf.jcu.cz\/kin\/wp-json\/wp\/v2\/comments?post=837"}],"version-history":[{"count":0,"href":"https:\/\/katedry.pf.jcu.cz\/kin\/wp-json\/wp\/v2\/pages\/837\/revisions"}],"wp:attachment":[{"href":"https:\/\/katedry.pf.jcu.cz\/kin\/wp-json\/wp\/v2\/media?parent=837"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}Okruhy k\u00a0p\u0159ij\u00edmac\u00ed zkou\u0161ce<\/h2>\n
Teoretick\u00e9 ot\u00e1zky<\/h3>\n
\nOpera\u010dn\u00ed syst\u00e9m \u2013 definice, funkce a vlastnosti. Multitasking, multiuser. P\u0159ehled OS
\na jejich charakteristika.
\n2. Procesy<\/strong>
\nBlokov\u00e9 sch\u00e9ma stav\u016f procesu. Multitasking. Preemptivn\u00ed a nepreemptivn\u00ed pl\u00e1nov\u00e1n\u00ed.
\nV\u00fdpis a ukon\u010den\u00ed procesu ve Windows a Linuxu.
\n3. Opera\u010dn\u00ed pam\u011b\u0165<\/strong>
\nV\u00fdznam opera\u010dn\u00ed pam\u011bti. Spolupr\u00e1ce procesoru a opera\u010dn\u00ed pam\u011bti. Z\u00e1kladn\u00ed funkce
\nspr\u00e1vce pam\u011bti. Metody spr\u00e1vy pam\u011bti bez virtu\u00e1ln\u00ed pam\u011bti a s virtu\u00e1ln\u00ed pam\u011bt\u00ed (popis
\nfungov\u00e1n\u00ed, v\u00fdhody a nev\u00fdhody).
\n4. Synchronizace proces\u016f<\/strong>
\nV\u00fdznam synchronizace proces\u016f. Algoritmy pro p\u0159\u00edstup do kritick\u00e9 sekce.
\nSynchroniza\u010dn\u00ed \u00falohy (producent – konzument, model – obraz, \u010dten\u00e1\u0159i – p\u00edsa\u0159i, p\u011bt
\nhladov\u00fdch filosof\u016f).
\n5. Architektura po\u010d\u00edta\u010d\u016f<\/strong>
\nArchitektury von Neumann vs. Harvard, funkce hlavn\u00edch komponent po\u010d\u00edta\u010de (pam\u011b\u0165,
\nprocesor, HDD, \u2026), sou\u010dasn\u00e9 alternativy (Raspberry Pi, smartphony).
\n6. Procesor.<\/strong>
\nProcesor, jeho blokov\u00e9 sch\u00e9ma. Aritmeticko-logick\u00e1 jednotka, s\u010d\u00edta\u010dka, \u0159adi\u010d, registry.
\nInstruk\u010dn\u00ed cyklus, pipeline.
\n7. Extern\u00ed pam\u011b\u0165<\/strong>
\nRozd\u00edl opera\u010dn\u00ed \u2013 extern\u00ed pam\u011b\u0165. Pevn\u00e9 disky: princip z\u00e1znamu a organizace dat.
\nSouborov\u00fd syst\u00e9m, z\u00e1kladn\u00ed organizace adres\u00e1\u0159\u016f, soubor\u016f. Metody alokace diskov\u00e9ho
\nprostoru.
\n8. S\u00ed\u0165ov\u00e1 vrstva<\/strong>
\nPopis IP protokolu, d\u016fle\u017eit\u00e9 atributy IP datagramu, principy hierarchick\u00e9ho
\nadresov\u00e1n\u00ed, adresov\u00e1n\u00ed pods\u00edt\u00ed, funkce sm\u011brova\u010d\u016f, next-hop adresa (\u010dinnost
\nsm\u011brova\u010de), struktura IP adresy (IPv4 i IPv6), maska s\u00edt\u011b.
\n9. Transportn\u00ed vrstva<\/strong>
\nFunkce transportn\u00ed vrstvy, protokoly TCP, UDP, kl\u00ed\u010dov\u00e9 funkce a pohled z hlediska
\nspolehlivosti, adresace port\u016f, segmentace, navazov\u00e1n\u00ed a ukon\u010den\u00ed spojen\u00ed. P\u0159\u00edklady,
\nkde je vhodn\u00e9 pou\u017e\u00edt TCP a kde UDP.
\n10. Architektura s\u00edt\u00ed, slu\u017eby s\u00edt\u00ed<\/strong>
\nPopis a porovn\u00e1n\u00ed architektury TCP\/IP a ISO OSI, funkce jednotliv\u00fdch vrstev.
\nProtokoly aplika\u010dn\u00ed vrstvy modelu TCP\/IP, Telnet, SSH, SMTP, POP, IMAP, HTTP
\na syst\u00e9m DNS), dal\u0161\u00ed aplikace.
\n11. Algoritmy \u2013 z\u00e1kladn\u00ed pojmy<\/strong>
\nDefinice algoritmu, z\u00e1kladn\u00ed vlastnosti algoritm\u016f. \u010casov\u00e1 a pam\u011b\u0165ov\u00e1 slo\u017eitost
\nalgoritm\u016f. P\u0159\u00edklady slo\u017eitost\u00ed zvolen\u00fdch algoritm\u016f (alespo\u0148 4 t\u0159\u00eddy slo\u017eitost\u00ed).
\n12. Datov\u00e9 struktury<\/strong>
\nZ\u00e1kladn\u00ed struktury \u2013 z\u00e1sobn\u00edk, fronta, prioritn\u00ed fronta, line\u00e1rn\u00ed spojov\u00e9 seznamy.
\nStromy, bin\u00e1rn\u00ed vyhled\u00e1vac\u00ed stromy. Princip, implementace, pou\u017eit\u00ed.
\n13. Spr\u00e1vnost algoritm\u016f<\/strong>
\nD\u016fkaz spr\u00e1vnosti algoritm\u016f, uk\u00e1zka vyu\u017eit\u00ed d\u016fkazu indukc\u00ed na algoritmu Insert Sort.
\n14. \u010casov\u00e1 slo\u017eitost algoritm\u016f \u2013 anal\u00fdza<\/strong>
\nOdvozen\u00ed \u010dasov\u00e9 slo\u017eitosti algoritm\u016f pro rekurzivn\u00ed algoritmus Merge Sort.
\n15. \u0158ad\u00edc\u00ed algoritmy<\/strong>
\nSelection Sort, Bubble Sort, algoritmus Quick Sort a jeho slo\u017eitost, Radix Sort a jeho
\nodli\u0161nost od zm\u00edn\u011bn\u00fdch t\u0159\u00ed algoritm\u016f.<\/p>\nPraktick\u00e9 probl\u00e9mov\u00e9 \u00falohy<\/h3>\n
\nReprezentace cel\u00fdch i re\u00e1ln\u00fdch \u010d\u00edsel. Bin\u00e1rn\u00ed k\u00f3d re\u00e1ln\u00e9ho \u010d\u00edsla v IEEE 754.
\nK\u00f3dov\u00e1n\u00ed znak\u016f v Unicode (UTF-32, -16, -8), ASCII, CP-1250. Pam\u011b\u0165ov\u00e1 n\u00e1ro\u010dnost
\ntextu u r\u016fzn\u00fdch syst\u00e9m\u016f k\u00f3dov\u00e1n\u00ed.
\n2. Digitalizace akustick\u00e9ho sign\u00e1lu, rastrov\u00e1 reprezentace obrazu<\/strong>
\nK\u00f3dov\u00e1n\u00ed analogov\u00e9ho sign\u00e1lu metodou PCM, nekomprimovan\u00e9 audio – pam\u011b\u0165ov\u00e1
\nn\u00e1ro\u010dnost. K\u00f3dov\u00e1n\u00ed rastrov\u00e9ho obr\u00e1zku, barevn\u00e1 hloubka. K\u00f3dov\u00e1n\u00ed barev RGB,
\nCMYK, HSL, t\u00e9\u017e v hexadecim\u00e1ln\u00ed soustav\u011b.
\n3. Metody komprese dat<\/strong>
\nKonkr\u00e9tn\u00ed vyu\u017eit\u00ed metod komprese. Kompresn\u00ed pom\u011br u kompresn\u00edch metod RLE,
\nLZW, Huffmanovo k\u00f3dov\u00e1n\u00ed, aritmetick\u00e9 k\u00f3dov\u00e1n\u00ed.
\n4. Relace<\/strong>
\nPojem a definice relace, vlastnosti relac\u00ed (reflexivnost, symetri\u010dnost, antisymetri\u010dnost,
\ntranzitivnost atd.). Zn\u00e1zorn\u011bn\u00ed relac\u00ed grafem. Skl\u00e1d\u00e1n\u00ed relac\u00ed.
\n5. Grafy<\/strong>
\nZ\u00e1kladn\u00ed pojmy, grafov\u00e9 operace. Stromy, kostry graf\u016f.
\n6. Principy vybran\u00fdch grafov\u00fdch algoritm\u016f
\nProbl\u00e9m nejkrat\u0161\u00ed cesty, toky v s\u00edt\u00edch, hladov\u00fd algoritmus.
\n7. Blokov\u00e9 programov\u00e1n\u00ed<\/strong>
\nPostavy ve Scratch jako objekty, jejich komunikace. V\u011btven\u00ed, podm\u00ednky. Pr\u00e1ce se
\nseznamy. Ud\u00e1lostmi \u0159\u00edzen\u00e9 paraleln\u00ed procesy. Procedury s parametry, prom\u011bnn\u00e9.
\n8. Programov\u00e1n\u00ed – programov\u00e9 struktury<\/strong>
\nV\u011btven\u00ed, iterace. Funkce s parametry. Operace s prom\u011bnn\u00fdmi primitivn\u00edch typ\u016f,
\n\u0159et\u011bzcov\u00fdmi prom\u011bnn\u00fdmi v Pythonu.
\n9. Programov\u00e1n\u00ed \u2013 datov\u00e9 struktury<\/strong>
\nPole, seznamy, manipulace s jejich prvky v Pythonu.
\n10. Objektov\u00e9 programov\u00e1n\u00ed<\/strong>
\nObjektov\u00fd n\u00e1vrh t\u0159\u00edd a jeho realizace<\/p>\n