Question 1

Searching for a particular value in a sequential container is generally an O(__________) process.

Accepted Answer

n

Question 2

You retrieve an object from a map by specifying its __________.

Accepted Answer

key

Question 3

What mathematicians call a(n) __________ can be thought of as a collection of objects.

Accepted Answer

set

Question 4

What is the result of performing the following operation?
{1, 3, 5, 7} - {2, 3, 4, 5}

Accepted Answer

The operation performed is a set difference, which removes the elements of the second set from the first set. Thus, {1, 3, 5, 7} - {2, 3, 4, 5} results in {1, 7}, as 3 and 5 are removed from the first set.

Question 5

There are no set union, set intersection, or set difference member functions in the C++ set class.

Accepted Answer

The set class in C++ provides member functions for set union, set intersection, and set difference operations.

Question 6

Suppose you are given two sets:

Set1 = {Apples, Peaches, Pineapples}
Set2 = {Apples, Grapes, Peaches}

The result of set1* set2 is __________.

Accepted Answer

The operation indicated by set1 * set2 is not a standard set operation. However, if we interpret the question as asking for the intersection of set1 and set2, the correct answer is C) {Apples, Peaches}, since these are the elements common to both sets.

Question 7

The vector and set both implement the common requirements of the container classes.

Accepted Answer

Both vector and set in C++ are container classes that implement common requirements such as iterators, size, and methods to check if they are empty, allowing for the storage and manipulation of data.

Question 8

The __________ is the same as the set except that it does not impose the requirement that the items be unique.

Accepted Answer

The answer of The __________ is the same as the...

Question 9

If the set fruits is
{"Apples", "Grapes", "Oranges", "Peaches", "Pears", "Pineapples", "Tomatoes"},
Then
Lower_bound("Oranges")
Would return an iterator to "__________", and
Upper_bound("Pineapples")
Would return an iterator to "Tomatoes".

Accepted Answer

DLower_bound("Oranges") would return an iterator to the first element that is not considered to go before "Oranges", which is "Oranges" itself. Upper_bound("Pineapples") would return an iterator to the first element that goes after "Pineapples", which is "Tomatoes".

Question 10

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

Accepted Answer

The answer of Mathematically a(n) __________ is a set of...

Question 11

Items are stored in a map as ordered by their __________ function.

Accepted Answer

The answer of Items are stored in a map as...

Question 12

Because the map class overloads the subscript operator such that the key is used as an index, a map is also known as a(n) __________ array.

Accepted Answer

A map is known as an associative array because it associates keys with values, allowing for direct access to values through their keys, similar to how an index works in traditional arrays, but with more flexibility in the choice of keys.

Question 13

Which of the following lines corrects the error in the Map class function? // Overload the subscript operator Value_Type& operator[ ](const Key_Type&k key) { std::pair ret = the_set.insert(Entry_Type(key, Value_Type[])); Entry_Type& entry(const_cast(*(ret.first))); return entry.second; }

Accepted Answer

The answer of Which of the following lines corrects the...

Question 14

The default value for the Compare template parameter is the Key_Type's __________ operator.

Accepted Answer

The default value for the Compare template parameter in many standard library containers, such as std::set or std::map, is the Key_Type's less-than operator. This allows the container to maintain its elements in a sorted order based on the less-than semantics.

Question 15

The subscript operator is defined for the multimap.

Accepted Answer

The subscript operator [] is not defined for the multimap container in C++. Multimap allows multiple elements with the same key, and the subscript operator is not suitable for this because it can only return a single element.

Question 16

The goal of the hash table is to access an entry based on its __________ value, not its location.

Accepted Answer

The answer of The goal of the hash table is...

Question 17

Using a hash table enables us to retrieve an item in __________.

Accepted Answer

Hash tables, under average circumstances, allow for item retrieval in expected constant time, O(1). However, due to potential collisions and the need for rehashing or chaining, this is an "expected" time rather than a guaranteed constant time.

Question 18

The statement 
int index = uni_char % __________;
computes an array index between 0 and 499 for a Unicode character.

Accepted Answer

The answer of The statement 
int index = uni_char %...

Question 19

To reduce the clustering of indexes in hash tables, __________ probing uses increments that form the series: (1 + 2²+ 3²; + · · ·).

Accepted Answer

Quadratic probing uses increments that form a series which includes quadratic terms (like the 1, 3, 5, 7, etc., pattern shown in the question). This helps in reducing clustering in hash tables by spreading out the probes more evenly than linear probing.

Question 20

An alternative to open addressing is a technique called __________, in which each table element references a linked list that contains all the items that hash to the same table index.

Accepted Answer

The answer of An alternative to open addressing is a...

Quiz 10: Sets and Maps

Searching for a particular value in a sequential container is generally an O(__________) process.

You retrieve an object from a map by specifying its __________.

What mathematicians call a(n) __________ can be thought of as a collection of objects.

What is the result of performing the following operation? {1, 3, 5, 7} - {2, 3, 4, 5}

There are no set union, set intersection, or set difference member functions in the C++ set class.

Suppose you are given two sets: Set1 = {Apples, Peaches, Pineapples} Set2 = {Apples, Grapes, Peaches} The result of set1* set2 is __________.

The vector and set both implement the common requirements of the container classes.

The __________ is the same as the set except that it does not impose the requirement that the items be unique.

If the set fruits is {"Apples", "Grapes", "Oranges", "Peaches", "Pears", "Pineapples", "Tomatoes"}, Then Lower_bound("Oranges") Would return an iterator to "__________", and Upper_bound("Pineapples") Would return an iterator to "Tomatoes".

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

Items are stored in a map as ordered by their __________ function.

Because the map class overloads the subscript operator such that the key is used as an index, a map is also known as a(n) __________ array.

Which of the following lines corrects the error in the Map class function? // Overload the subscript operator Value_Type& operator[ ](const Key_Type&k key) { std::pair ret = the_set.insert(Entry_Type(key, Value_Type[]) ) ; Entry_Type& entry(const_cast(*(ret.first) ) ) ; return entry.second; }

The default value for the Compare template parameter is the Key_Type's __________ operator.

The subscript operator is defined for the multimap.

The goal of the hash table is to access an entry based on its __________ value, not its location.

Using a hash table enables us to retrieve an item in __________.

The statement int index = uni_char % __________; computes an array index between 0 and 499 for a Unicode character.

To reduce the clustering of indexes in hash tables, __________ probing uses increments that form the series: (1 + 2²+ 3²; + · · ·) .

An alternative to open addressing is a technique called __________, in which each table element references a linked list that contains all the items that hash to the same table index.

Quiz 10: Sets and Maps

Searching for a particular value in a sequential container is generally an O(__________) process.

You retrieve an object from a map by specifying its __________.

What mathematicians call a(n) __________ can be thought of as a collection of objects.

What is the result of performing the following operation? {1, 3, 5, 7} - {2, 3, 4, 5}

There are no set union, set intersection, or set difference member functions in the C++ set class.

Suppose you are given two sets: Set1 = {Apples, Peaches, Pineapples} Set2 = {Apples, Grapes, Peaches} The result of set1* set2 is __________.

The vector and set both implement the common requirements of the container classes.

The __________ is the same as the set except that it does not impose the requirement that the items be unique.

If the set fruits is {"Apples", "Grapes", "Oranges", "Peaches", "Pears", "Pineapples", "Tomatoes"}, Then Lower_bound("Oranges") Would return an iterator to "__________", and Upper_bound("Pineapples") Would return an iterator to "Tomatoes".

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

Items are stored in a map as ordered by their __________ function.

Because the map class overloads the subscript operator such that the key is used as an index, a map is also known as a(n) __________ array.

Which of the following lines corrects the error in the Map class function? // Overload the subscript operator Value_Type& operator[ ](const Key_Type&k key) { std::pair ret = the_set.insert(Entry_Type(key, Value_Type[]) ) ; Entry_Type& entry(const_cast(*(ret.first) ) ) ; return entry.second; }

The default value for the Compare template parameter is the Key_Type's __________ operator.

The subscript operator is defined for the multimap.

The goal of the hash table is to access an entry based on its __________ value, not its location.

Using a hash table enables us to retrieve an item in __________.

The statement int index = uni_char % __________; computes an array index between 0 and 499 for a Unicode character.

To reduce the clustering of indexes in hash tables, __________ probing uses increments that form the series: (1 + 22+ 32; + · · ·) .

An alternative to open addressing is a technique called __________, in which each table element references a linked list that contains all the items that hash to the same table index.

To reduce the clustering of indexes in hash tables, __________ probing uses increments that form the series: (1 + 2²+ 3²; + · · ·) .