{"id":3138,"date":"2021-11-24T11:48:48","date_gmt":"2021-11-24T10:48:48","guid":{"rendered":"https:\/\/nblok306.ftn.uns.ac.rs\/~zoran\/?page_id=3138"},"modified":"2026-02-06T08:12:03","modified_gmt":"2026-02-06T07:12:03","slug":"ai-13-20-iam002-diskretne-i-kombinatorne-metode-za-racunarsku-grafiku","status":"publish","type":"page","link":"https:\/\/nblok306.ftn.uns.ac.rs\/~zoran\/?page_id=3138","title":{"rendered":"AI.{13.20}.IAM002.Diskretne i kombinatorne metode za ra\u010dunarsku grafiku"},"content":{"rendered":"\n\n\n\n\n
SEMESTAR<\/strong><\/td>\n3<\/td>\n<\/tr>\n
ESPB<\/strong><\/td>\n4<\/td>\n<\/tr>\n
FOND \u010cASOVA<\/strong><\/td>\n2+2<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

Sadr\u017eaj<\/h3>\n

1 Analiza algoritama<\/h4>\n

1.1 Algoritmi za pretra\u017eivanje
1.2 Asimptotske oznake
1.3 Slo\u017eenost algoritama
1.4 Rekurzija
1.5 Algoritmi za sortiranje
1.5.1 Bubble sort
1.5.2 Insertion sort
1.5.3 Selection sort
1.5.4 Merge sort
1.5.5 Quick sort<\/p>\n

2 Apstraktni tipovi podataka (ADT)<\/h4>\n

2.1 Matrice
2.2 Polinomi
2.3 Stack
2.4 Queue
2.5 Primene<\/p>\n

3 Grafovi kao ADT<\/h4>\n

3.1 Osnovne definicije
3.2 Strukture podataka za grafove
3.3 Pretra\u017eivanje u \u0161irinu (BFS) i primene
3.4 Pretra\u017eivanje u dubinu (DFS) i primene
3.5 Minimalno pokrivaju\u0107e drvo (MST)
3.6 Binarna drva<\/p>\n

4 Primene<\/h4>\n

3.7 Problem anga\u017eovanja
3.8 Problem trgova\u010dkog putnika<\/p>\n

Pitanja za usmeni<\/h3>\n

1. Kompjuteri i programski jezici – istorija i principi
2. Bubble sort
3. Insertion sort
4. Selection sort
5. Merge sort
6. Quick sort
7. Slo\u017eenost algoritama i asimptotske oznake
8. Rekurzija
9. Pregled algoritama za sortiranje
10. Protra\u017eivanje
11. Matrice
12. Povezane liste
13. Stack pomo\u0107u povezanih listi
14. Queue pomo\u0107u povezanih listi
15. Stack pomo\u0107u nizova
16. Queue pomo\u0107u nizova
17. Grafovi, osnovne definicije i teoreme
18. Strukture podataka za grafove
19. Breadth first search (BFS)
20. Algoritmi nad grafovima (stepen, diametar, path, …)
21. Depth first search (DFS)
22. DFS forest, tipovi grana
23. DFS forest, topolo\u0161ko sortiranje
24. DFS forest, jako povezane komponente
25. Minimalno pokrivaju\u0107e drvo, Kruskal
26. Minimalno pokrivaju\u0107e drvo, Prim
27. Binarna drva, LC-RC reprezentacija
28. Binary search tree sort
29. Problem anga\u017eovanja, ma\u0111arska metoda
30. Problem trgova\u010dkog putnika<\/p>\n

Na\u010din polaganja<\/h3>\n

Predmet se sastoji iz zadataka koji se pola\u017eu pismeno i teorije koja se pola\u017ee na usmenom delu.<\/p>\n

Pismeni delovi se pola\u017eu u toku slu\u0161anja nastave preko kolokvijuma i u svakom ispitnom roku u terminu za koji je prijavljen ispit.<\/p>\n

Va\u017eenje pismenog dela polo\u017eenog preko kolokvijuma je do kraja kalendarske godine u kojoj je odslu\u0161an predmet ili do poni\u0161tavanja izlaskom na pismeni ispit i re\u0161avanjem zadataka iz odgovaraju\u0107eg dela.<\/p>\n

Va\u017eenje pismenog dela polo\u017eenog u ispitnom roku je do usmenog ispita u tom roku, najdu\u017ee 7 dana.<\/p>\n

Postoji minimalan broj bodova koji se mora osvojiti da bi se neki deo pismenog ispita ra\u010dunao kao polo\u017een.<\/p>\n

Usmeni ispit se odr\u017eava par dana posle pismenog ispita, u terminu dogovorenom na pismenom ispitu. Na usmeni ispit su pozvani studenti koji su prijavili ispit u tom roku i imaju polo\u017eene pismene delove.<\/p>\n

Ocene se formiraju na osnovu osvojenih bodova, u skladu sa Statutom FTN-a: 51+ -> 6, 61+ -> 7, …<\/p>\n\n\n\n\n\n\n
 <\/td>\nDeo 1<\/td>\nDeo 2<\/td>\nUsmeni<\/td>\nsuma<\/td>\n<\/tr>\n
MAX<\/td>\n40<\/td>\n40<\/td>\n20<\/td>\n100<\/td>\n<\/tr>\n
MIN<\/td>\n18<\/td>\n18<\/td>\n0<\/td>\n51<\/td>\n<\/tr>\n
Datum kolokvijuma<\/td>\n18. I 2026
7:30 A1, A2<\/td>\n		14. II 2026
8:00 A1<\/td>\n		 <\/td>\n <\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

 <\/p>\n\n\n

Literatura<\/h3>\n\n\n\n
    \n
  1. Po\u010detak knjige<\/a><\/li>\n\n\n\n
  2. Folije<\/a><\/li>\n\n\n\n
  3. Ostalo<\/a><\/li>\n\n\n\n
  4. Introduction to Algorithms, fourth edition<\/a><\/li>\n<\/ol>\n\n\n\n

    <\/p>\n","protected":false},"excerpt":{"rendered":"

    SEMESTAR 3 ESPB 4 FOND \u010cASOVA 2+2 Sadr\u017eaj 1 Analiza algoritama 1.1 Algoritmi za pretra\u017eivanje1.2 Asimptotske oznake1.3 Slo\u017eenost algoritama1.4 Rekurzija1.5 Algoritmi za sortiranje1.5.1 Bubble sort1.5.2 Insertion sort1.5.3 Selection sort1.5.4 Merge sort1.5.5 Quick sort 2 Apstraktni tipovi podataka (ADT) 2.1 Matrice2.2 Polinomi2.3 Stack2.4 Queue2.5 Primene 3 Grafovi kao ADT 3.1 Osnovne definicije3.2 Strukture podataka za grafove3.3 […]<\/p>\n","protected":false},"author":1,"featured_media":0,"parent":3119,"menu_order":1,"comment_status":"closed","ping_status":"closed","template":"","meta":{"ngg_post_thumbnail":0,"footnotes":""},"class_list":["post-3138","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/nblok306.ftn.uns.ac.rs\/~zoran\/index.php?rest_route=\/wp\/v2\/pages\/3138","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/nblok306.ftn.uns.ac.rs\/~zoran\/index.php?rest_route=\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/nblok306.ftn.uns.ac.rs\/~zoran\/index.php?rest_route=\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/nblok306.ftn.uns.ac.rs\/~zoran\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/nblok306.ftn.uns.ac.rs\/~zoran\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=3138"}],"version-history":[{"count":21,"href":"https:\/\/nblok306.ftn.uns.ac.rs\/~zoran\/index.php?rest_route=\/wp\/v2\/pages\/3138\/revisions"}],"predecessor-version":[{"id":3922,"href":"https:\/\/nblok306.ftn.uns.ac.rs\/~zoran\/index.php?rest_route=\/wp\/v2\/pages\/3138\/revisions\/3922"}],"up":[{"embeddable":true,"href":"https:\/\/nblok306.ftn.uns.ac.rs\/~zoran\/index.php?rest_route=\/wp\/v2\/pages\/3119"}],"wp:attachment":[{"href":"https:\/\/nblok306.ftn.uns.ac.rs\/~zoran\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=3138"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}