Is separate chaining a conflict resolution mechanism based on open addressing?

How does separate chaining work?

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?