Bitmask assignment

Questions 1 to 5 of 6

1. 1. The best table in the assignment program has one slot for each set of tasks, so with 16 people it has 2^16 slots. Each slot holds one 8-byte reference to an int. How many bytes does one best list take, ignoring the int objects and the list header?

   Type a number.

2. 2. The table method does at most 2^n * n steps for n people. For 15 people, what is the most steps it can take?

   Type a number.

3. 3. In this program's cost table, what does a None entry mean?

   The person is paid one unit less for that taskThe person can do the task, at the lowest cost in the tableThe pair is forbidden, so the program skips itThe same task is given to the person twice
4. 4. Why does the program process the masks in increasing numeric order?

   Adding a task always makes the mask bigger, so every smaller set is finished before a bigger set reads its valueBigger masks are stored in a second table that must be filled firstThe masks must be sorted by person number before the loop can use themPython's range can only count up by one on every loop step
5. 5. What does this program print? ``python mask = 0b0110 print(mask.bit_count()) print((mask & (1 << 1)) != 0) print(mask | (1 << 0)) ``

   2, False, 7 (one per line)4, True, 7 (one per line)2, True, 6 (one per line)2, True, 7 (one per line)