How do you do these two questions? The first might have multiple answers and the second will have only one answer.

1. Generally Linkedlist is used, but you can also use the queue. Hence both linked list are queue are correct options. However, treeset is sorted and hashset is not sorted, and hence we cannot make use of the treeset. Similarly the stack cannot as well be used as a Hashset.

2. D. Additional cells in the same hashset are examined and the index is incremented by a fixed value each time.

Explanation:

The 2 deals with the linear probing, and what is meant as option in 2 is what we know as linear probing in hashset, and we do have quadratic probing and double probing as well.