Exam 7: Sets and Maps

Which of the following is an example of a map?

An alternative to open addressing is a technique called _____________________.

A NavigableSet (NavigableMap) allows the programmer to create _____________ of a Set (Map).

____ occur(s) because you can only store one key-value pair in a given array element.

If we compare hash table performance with binary search of a sorted array, the number of comparisons required by binary search is ____.

Collections implementing the Set interface must contain unique elements.

With respect to the Map interface, the ____ method returns the current value associated with a given key.

An advantage of ____________________ is that you can store more elements in the table than the number of table slots (indexes).

With respect to the Map interface, the ____ method either inserts a new mapping or changes the value associated with an existing mapping.

The following is an algorithm for ____. Compute the index by taking the item's hashCode() % table.length. If table[index] is null The item is not in the table. Else if table[index] is equal to the item The item is in the table. Else Continue to search the table by incrementing the index until either the item is found or a null entry is found.

Using a hash table enables us to retrieve an item in O(n²) time.

Mathematically, a(n) ___________________ is a set of ordered pairs whose elements are known as the key and the value.

The union of two sets A, B is a(n) ____.

The intersection of sets A, B is a set ____.

Method ____ creates a set view of the entries in a Map.

The basis of ____________________ is to transform the item's key value to an integer value which will then be transformed into a table index.

Although you cannot reference a specific element of a Set, you can iterate through all its elements using an Iterator object.

A NavigableSet (NavigableMap) can be traversed in reverse order.

In ____________________ addressing, search chains can overlap, so a search chain may include items in the table that have different starting values.

With respect to hash tables, if there are no collisions, the performance for search and retrieval is O(n), regardless of table size.