hash table

1. Suppose that a dynamic table was used to store a hash table. That way we can ensure that the hash table is never half full or more, and performance should be good. Does the amortized analysis guarantee that the average cost of a put operation on the hash table will be constant time? Does it guarantee that the expected average cost of a put operation will be constant time? Justify your answers.?


1. Suppose that we have a perfect hash function. Is using a dynamic table to store the hash table useful? Why or why not?