Question 1

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

Accepted Answer

A) True 
 B)False  True

Question 2

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

Accepted Answer

A)  {-1, 0, 1, 2} 
B)  {1, 7} 
C)  {2, 4} 
D)  {1, 0, -1, -2} 
A)  {-1, 0, 1, 2} 
B)  {1, 7} 
C)  {2, 4} 
D)  {1, 0, -1, -2} B

Question 3

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

Accepted Answer

key

Question 4

The subscript operator is defined for the multimap.

Accepted Answer

A) True 
 B)False

Question 5

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

Accepted Answer

The answer of What mathematicians call a(n) __________ can be...

Question 6

A hash function that evaluates indexes based on an original int value modulo the size of the hash table tends to uniformly distribute keys.

Accepted Answer

A) True 
 B)False

Question 7

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 8

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

Accepted Answer

A)  constant 
B)  linear 
C)  quadratic 
D)  exponential 
A)  constant 
B)  linear 
C)  quadratic 
D)  exponential

Question 9

Worst-case performance for a hash table or a binary search tree is O(__________).

Accepted Answer

A)  1 
B)  log n 
C)  n 
D)  n log n 
A)  1 
B)  log n 
C)  n 
D)  n log n

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

Consider the formula for evaluating the number of hash table comparisons:
$ c=1 / 2^{(1+1 /(1-L))} $, where c = the number of comparisons and L = the load factor.
Given that a hash table of size 100,000 contains 20,000 items, how many comparisons are expected in a linear probe for an item?

Accepted Answer

A)  .5 
B)  .625 
C)  1.125 
D)  3 
A)  .5 
B)  .625 
C)  1.125 
D)  3

Question 13

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 14

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

Accepted Answer

A)  {Peaches} 
B)  {Apples} 
C)  {Apples, Peaches} 
D)  {Apples, Grapes, Peaches, Pineapples} 
A)  {Peaches} 
B)  {Apples} 
C)  {Apples, Peaches} 
D)  {Apples, Grapes, Peaches, Pineapples}

Question 15

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...

Question 16

Which of the following lines corrects the error in the Map class function?

Accepted Answer

A) Value_Type operator[ ](const Key_Type& key) B) Value_Type& operator( )(const Key_Type& key) C) std::pair ret = the_set.insert(Entry_Type(key, Value_Type())); D) std::pair ret = the_set.insert(Entry_Type(key, ())); A) Value_Type operator[ ](const Key_Type& key) B) Value_Type& operator( )(const Key_Type& key) C) std::pair ret = the_set.insert(Entry_Type(key, Value_Type())); D) std::pair ret = the_set.insert(Entry_Type(key, ()));

Question 17

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

A)  Apples 
B)  Grapes 
C)  Oranges 
D)  Peaches 
A)  Apples 
B)  Grapes 
C)  Oranges 
D)  Peaches

Question 18

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

Accepted Answer

A)  less-than-or-equal-to 
B)  less-than 
C)  greater-than 
D)  greater-than-or-equal-to 
A)  less-than-or-equal-to 
B)  less-than 
C)  greater-than 
D)  greater-than-or-equal-to

Question 19

Static data members must be initialized inside the class declaration.

Accepted Answer

A) True 
 B)False

Question 20

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

Accepted Answer

A) True 
 B)False

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

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

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

The subscript operator is defined for the multimap.

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

A hash function that evaluates indexes based on an original int value modulo the size of the hash table tends to uniformly distribute keys.

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²; + · · ·).

Worst-case performance for a hash table or a binary search tree is O(__________).

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.

Consider the formula for evaluating the number of hash table comparisons: $c=1 / 2^{(1+1 /(1-L))}$ , where c = the number of comparisons and L = the load factor. Given that a hash table of size 100,000 contains 20,000 items, how many comparisons are expected in a linear probe for an item?

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

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

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.

Which of the following lines corrects the error in the Map class function?

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".

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

Static data members must be initialized inside the class declaration.

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

P A C++ Primer

Introduction to Software Design

Program Correctness and Efficiency

Inheritance and Class Hierarchies

Sequential Containers

Stacks

Queues and Deques

Recursion

Trees

Sorting

Self-Balancing Search Trees

Graphs

Advanced C++ Topics, and Overview of UML

Filters

Exam 10: Sets and Maps

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

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

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

The subscript operator is defined for the multimap.

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

A hash function that evaluates indexes based on an original int value modulo the size of the hash table tends to uniformly distribute keys.

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; + · · ·).

Worst-case performance for a hash table or a binary search tree is O(__________).

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.

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

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

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.

Which of the following lines corrects the error in the Map class function?

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".

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

Static data members must be initialized inside the class declaration.

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

P A C++ Primer

Introduction to Software Design

Program Correctness and Efficiency

Inheritance and Class Hierarchies

Sequential Containers

Stacks

Queues and Deques

Recursion

Trees

Sorting

Self-Balancing Search Trees

Graphs

Advanced C++ Topics, and Overview of UML

Filters

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