1 The worst-case access time of a chaining/hashing implementation of sets or dictionaries is a constant b logarithmic c linear 2 A dictionary has a a single method that supports an iterator b two...

1 The worst-case access time of a chaining/hashing implementation of sets or dictionaries is

a constant

b logarithmic

c linear

2 A dictionary has

a a single method that supports an iterator b two methods that support iterators, one for the keys and one for the values

10 A method to avoid clustering is

a linear probing

b quadratic probing