Exam 13: Standard Template Library (STL) II

The function remove is used to remove the elements from a sequence by using some criteria.

The only difference between the containers map and multimap is that the container map allows duplicates, whereas the multimap container does not.

The STL relational function objects can also be applied to containers.

The algorithms includes (subset), set_intersection, set_union, set_difference, and set_symmetric_difference assume that the elements within each given range are not sorted.

The general syntax to declare an object of type pair is ____.

The default ordering criterion for the elements in an associative container is the relational operator ____.

With the help of the function make_pair, we can create pairs without explicitly specifying the type pair.

The ____ contains algorithms that only look at the elements in a container and that move the elements of a container.

The algorithm maxi is used to determine the maximum of two values.

Both the containers set and multiset automatically sort their elements according to some sort criteria.

In the second form of ____, the binary operation op is applied to the elements in the range.

The algorithm reverse reverses the order of the elements in a given range.

The STL provides four insert iterators to insert elements at a destination.

The first form of the function transform has three parameters.

Elements in an associative container are not sorted automatically.

Because the data members of an object of type pair are private, each object of type pair can directly access these data members in a program.

The algorithm ____ reverses the elements of a given range while copying into a destination range.

A convenient and fast way to implement an associative container data structure is to use a ____.

Nonmodifying algorithms do not modify the elements of the container.

Modifying algorithms that change the order of the elements, not their values, are also called ____.