Here's the question you clicked on:
David_Novo
Can anyone give me the solutions for the practice quiz 1 Spring 2011 or some feedback on my answers please? 1.1 true 1.2 false 1.3 true 1.4 false 1.5 false 3.2) O(n) n=length(cyphertext) 6.2)No. In python, the elements of a dictionaire (as is d) don't have an order. Thus, it is not possible to predict which key of d will be evaluated first as k. If ''b'' is evaluated first, when a is evaluated, y will remain as "b" beucase d["b"]=d["a". The opposite will happen if "c" is evaluated first.
6.3)No. If the string is an empty string, it will generate an error because, as there will occur no iterations, there won't be a value assigned to y. 4) if len(v1)<=len(v2): big=v2 small=v1 else: big=v1 small=v2 v3=[0]*len(big) for i in range(len(small)): v3[i] = big[i]+small[i] v3[(i+1):] = big[(i+1):] if v3==0: return [] else: return v3
Can anyone at least tell me if the following is True or False: 'When Newton’s method is used to find the root of a polynomial, the order of complexity is quadratic in the number of terms in the polynomial. '
TA goes through answers in recitation.
No, he doesn't. He goes through the answers to the Quiz. I'm looking for the answers to the Practice Quiz.