Meeting rooms in Python

Questions 1 to 5 of 6

1. 1. What does this code print? ``python import heapq ends = [] best = 0 for start, end in [(0, 3), (0, 3), (4, 5)]: while ends and ends[0] <= start: heapq.heappop(ends) heapq.heappush(ends, end) best = max(best, len(ends)) print(best, len(ends)) ``

   1 12 12 21 2
2. 2. What does this code print? ``python import heapq ends = [] for start, end in [(0, 30), (30, 60)]: while ends and ends[0] < start: heapq.heappop(ends) heapq.heappush(ends, end) print(len(ends)) ``

   10230
3. 3. Which statements about the two meeting-room methods are true? Choose all that apply.

   Pick every answer that is true.

   The heap method needs no sort, because heapq always returns meetings in start orderThe sweep sorts the start times and the end times in two separate listsA heapq heap must be declared with a type, such as list[int], before heappush worksThe heap method can tell which room frees up next, while the sweep only returns a count
4. 4. The heap method frees a finished room by taking the smallest end time out of the heap. Which heapq function does it call for that? Give the function name.

   Type your answer.

5. 5. In the heap method, what does the heap's size equal at each step?

   The number of rooms ever openedThe total number of meetings processed so farThe latest end time seen so farThe number of rooms busy at the current start time