Why don't we use an extreme large prime (eg: around 2 million) for the table size

What does the concept of a collision mean in the context of hashing?

Which of the following operations is not part of the Dictionary ADT?

If I was to loop over this Iterator, how many times would it iterate?

class NumberIterator:
    def __init__(self):
        self.current = 1
        
    def __iter__(self):
        return self
        
    def __next__(self):
        if self.current > 10:
            raise StopIteration()
        
        next_item = self.current
        self.current += 2
        return next_item

If we were to compare Queue ADT's append() and serve() method operations implemented using linked nodes vs using array, which one is more efficient in terms of worst-case time complexity of their operations?

I want to add a new method to the Linked Stack class to combine the current stack self with another stack other provided as an argument. You may see this as an in-place update of stack self. What would be the worst-case time complexity of this operation assuming that

self:  1 -> 2 -> 3 -> 4 -> 5   [1 is the top element]
other: 6 -> 7 -> 8 -> 9 -> 10  [6 is the top element]
The result should be:
self:  6 -> 7 -> 8 -> 9 -> 10 -> 1 -> 2 -> 3 -> 4 -> 5  [6 is the top element]

I wish to make a container class to be iterable. Which of the following statements are true?

The main operations of the Queue ADT are append() and serve(). We wish to implement the queue using linked nodes. What are the time complexities of these methods? We can assume

I have a List class and I wish to create an Iterator for it. What are the benefits of putting the Iterator in a separate class?

What is TRUE about a Python Generator?