I want to keep track of the number of conflicts and collisions I have. So far, I have observed 4 conflicts and 2 collisions. I add a single item Charlie to the hash table. The hash position for Charlie is 0. What will my updated values be?

What is one disadvantage of Linear Probing?

I have a Hash Table with Linear Probing and lazy deletion. I am searching for an item, and notice whilst searching I skipped over multiple slots marked for deletion. What should I do?

I want to traverse through a Dictionary implemented as a Linear Probing Hash Table, how should I do it?

I want to keep track of the number of conflicts and collisions I have. So far, I have observed 4 conflicts and 2 collisions. I add a single item Charlie to the hash table. The hash position for Charlie is 4. What will my updated values be?

Can separate chaining conflict resolution can be implemented using Array instead of linked nodes? 

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

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

1. Briefly describe a bit-vector, giving details about

• How an element of a set is represented by means of a bit-vector
• How bit-vector based sets operate

Give an example of a set and its representation as a bit-vector. [3]

2. What is the best-case and worst-case time complexity of the add() and intersection() operations for a Set ADT, if implemented with an array? (no explanation no marks). [4]

3. What are the main advantages and disadvantages of an array-based implementation of the Set ADT compared to a bitvector-based implementation? State the advantages and disadvantages as separate sections for each. [3]

• Main property of a List ADT; [2]
• Key operations of the List ADT. [2]