Memo and constraints

Questions 1 to 5 of 8

1. 1. What is the name for storing each computed answer so that a later call with the same input reads it back instead of computing it again?

   Type your answer.

2. 2. In functools.lru_cache, what do the letters LRU stand for?

   Type your answer.

3. 3. Your plan checks every pair of numbers in a list of n = 100000 items. Using n times (n - 1) divided by 2, how many pair checks does it make?

   Type a number.

4. 4. Which statements about the step budget and the limit table in this lesson are true?

   Pick every answer that is true.

   A compiled program is planned at about 10^8 steps in one secondA Python loop with real work is planned at about 2 × 10^7 steps in one secondA Python loop is planned at about 10^9 steps in one secondA limit of n at most 10^6 fits an n squared approachA limit of n at most 5,000 fits an n squared approach
5. 5. A cache for grid path counts is given maxsize=16 instead of no limit, and the grid is 30 by 30. Compared with the unbounded cache, what happens?

   It does about the same number of misses, with fewer entriesIt does about eight times as many missesIt uses more memory and makes fewer missesIt returns wrong path counts