EECS 70A Lecture 12: EECS 70A - Lec 12：Ch6.1 - Capacitor

Question 11. [5 MARKS] Each code fragment in the table below operates on list L, which has length k where k is very large - at least in the tens of thousands. For each fragment, give an expression in terms of k for how many times happy! is printed, and circle whether the behaviour is constant, linear, quadratic or something else. Code How many times is happy! printed? Complexity (circle one) for i in range (len (L)): print('happy!') for item in L: print('happy!') constant linear quadratic something else for i in range (len(L)) for item in L[:i]: print('happy!' constant linear quadratic something else # Precondition: len(L) % 10 == 0 i = 0 while i < len(L): print("happy!') i = i + len(L) // 10 constant linear quadratic something else for item in L[1000:2000] : print('happy!' constant linear quadratic something else for item in L[10:] : print('happy!' constant linear quadratic something else

18. Which choice below will cause all of the values stored in the array data to be printed out in reverse order? int[] data = {22, 17, 95, 16, 103, -14, 95}; // Choice A for (int i = data.length-1; i >= 0; i--) { print (data[i] + " "); // Choice B for (int i = 0; i < data.length; i++) { print (data[data.length-l-i] + " "); C. Both A and B will print all of the elements in reverse order. D. Neither A nor B will print all of the elements in reverse order

35. Line 3 (A) if (a[i] > a[i+1]) { return false; } (B) if (a[i] > a[i-1]) { return true; } (C) if (a[i] > a[i+1]) { return true; } (D) if (b > a[i+1]) { return b; } (E) i++; }