Professional Documents
Culture Documents
test znanja
Naslovna Kolegiji
2. test znanja
Review of attempt 1
Finish review
1 Koje programske strukture (podataka) možemo iskoristiti kako bi napisali QuickSort algoritam?
Marks: 8
Choose at least 1. Stog
one answer.
2. Opće stablo
3. Povezani popis
4. Rekurzivnu funkciju
5. Matrica
Correct
Marks for this submission: 8/8.
Answer: 720
Correct
Marks for this submission: 9/9.
Answer: tbdacs
Incorrect
Correct answer: s c d t b a
Marks for this submission: 0/8.
3. Edmonds-Karpov algoritam
4. Bellman-Fordov algoritam
5. Floyd-Warshallov algoritam
Correct
Marks for this submission: 8/8.
5 Tok u mreži G(V,E) koja ima pridjeljen kapacitet bridovima c:E->R, je funkcija f:E->R.
Povežite svojstvo izraženo matematički s njegovim nazivom.
Marks: 8
Correct
Marks for this submission: 8/8.
povezani graf
nepovezani graf
povezani graf
povezani graf
Incorrect
Marks for this submission: 0/8.
Stog Stack
Red Queue
moodle.etf os.hr/mod/quiz/rev iew.php?attempt=24796 5/9
21. 12. 2012. AISP 2012./2013.: 2. test znanja
Niz Array
Correct
Marks for this submission: 8/8.
Answer: 36
Incorrect
Correct answer: 21.00
Marks for this submission: 0/10.
6/9
21. 12. 2012. AISP 2012./2013.: 2. test znanja
Answer: rovovi
Correct
Marks for this submission: 8/8.
Incorrect
Correct answer: DC FL RI SC WA
Marks for this submission: 0/8.
11 Obilazak binarnog stabla koji funkcionira po principu LND (lijevi-nadređeni-desni) naziva se još i ...
Marks: 8
Choose one a. postorder
answer.
b. preorder
c. po širini
d. inorder
Correct
Marks for this submission: 8/8.
21. 12. 2012. AISP 2012./2013.: 2. test znanja
Answer: 29
Correct
Marks for this submission: 9/9.
Finish review