Library and hash costs

Questions 1 to 5 of 8

1. 1. What does this code print? ``python items = [] shifts = 0 for i in range(4): shifts += len(items) items.insert(0, i) print(shifts, items) ``

   4 [3, 2, 1, 0]6 [0, 1, 2, 3]6 [3, 2, 1, 0]10 [3, 2, 1, 0]
2. 2. What does this code print? ``python from collections import deque dq = deque([1, 2, 3]) dq.appendleft(0) dq.popleft() print(list(dq)) ``

   [0, 1, 2, 3][1, 2, 3][2, 3][1, 2, 3, 0]
3. 3. A loop builds a string of 1000 pieces, one character each. Each step with s = s + "x" copies the whole string, as in the copied_characters run in the lesson. How many characters are written in total?

   Type a number.

4. 4. Which statements about checking membership with in are true?

   Pick every answer that is true.

   On a list, a missing value costs as many comparisons as the list is longOn a set, one membership check takes about the same time whatever the size of the setA set check on a missing value scans every item in the set firstA list check is faster than a set check once the list has 40,000 items
5. 5. A loop adds to a string with +=, and another variable still holds the old string, so the whole string is copied on each step. When n doubles, how does the total time change?

   It stays about the sameIt about doublesIt about quadruplesIt about grows eightfold