Sieve in Python

Questions 1 to 5 of 6

1. 1. What does this code print? ``python n = 20 composite = [False] * n for p in range(2, n): if not composite[p]: for m in range(p * p, n, p): composite[m] = True count = 0 for i in range(2, n): if not composite[i]: count += 1 print(count) ``

   10879
2. 2. Java wraps a product that is too big for its int. What does this Python code print? ``python p = 50000 print(p * p) ``

   0-1794967296-21474836482500000000
3. 3. The sieve of Eratosthenes, for a limit n, makes about how many writes into the list? Give the tightest Big O notation for that count.

   O(n^2)O(n log n)O(n log log n)O(n sqrt n)
4. 4. The [False] * n list has one slot for each number below n. What is its memory use in Big O notation?

   O(1), because booleans are tinyO(log n)O(n log log n)O(n)
5. 5. Fill in the blank. The expression [False] * n makes a list where every slot starts as ___. Write the Python word.

   Type your answer.