Analysis of Algorithms in Java

a. When a direct-address table T is not feasible due to the size of Universe of keys, how can we solve this issue?

b. What is a collision in hash table? How do we resolve the collisions in open addressing? How do we resolve it in chaining? What is the worst-case performance of hash table for standard operations: search/insert/delete?

c. How does perfect hashing eliminate collision for static data?

d. Does Universal hashing function eliminate collision for static data?