Edit this page Backlinks This page is read only. You can view the source, but not change it. Ask your administrator if you think this is wrong. 1.Fie $math[M] o masina Turing cu o singura stare, care accepta doar sirul vid $math[\epsilon] si $math[f] o problema acceptata de $math[M]. Care afirmatii sunt adevarate: * $math[f \in RE] * $math[f \in R] * $math[f \in RE\setminus R] * $math[\exists w. f(w) = 0] * $math[\exists w. f(w) = 1] 2.Fie $math[f] o problema NP-dura, $math[g] o problema NP-completa si $math[g \leq_p f]. Care afirmatii sunt adevarate? * $math[f \in R] * $math[f \in NP] * $math[g \in R] * $math[g \in NP] 3.Dati un exemplu de **algoritm** care are timpul de executie in $math[O(n)] dar nu $math[\Theta(n)]. //Solutie: Verificarea daca o lista e sortata// 4. Care este complexitatea unei implementari a Masinii Turing Universale? 5.Care este complexitatea simularii urmatoarei proceduri: <code python> def f(l): x = choice(l) s = x for i in range(0,len(l)): s = s + l[i] </code> 6.Ce putem spune despre un tip de date abstract care are doar constructori de baza **nulari**? (Ce este un constructor de baza nular?).