Exam 13: Standard Template Library (STL) II

The algorithm ____ is used to manipulate the elements of two ranges.

The algorithms accumulate, adjacent_difference, inner_product, and partial_sum are numerical functions and manipulate numeric data.

The algorithm ____ is used to randomly order the elements in a given range.

A ____ contains a function that can be treated as a function using the function call operator, ().

With the help of the ____, two values can be combined into a single unit and, therefore, can be treated as one unit.

Every object of type pair has two data members, first and second, and these two data members are private.

The algorithm ____ counts the occurrences of a given value in a given range.

The algorithm ____ merges the sorted lists.

The algorithm ____ is used to find the elements in one range of elements that do not appear in another range of elements.

The class pair has two constructors: the default constructor and a constructor with two parameters.

To make the generic algorithms flexible, the STL usually provides three forms of an algorithm using the mechanism of function overloading.

The second form of the function transform has three parameters.

The algorithm find_adjacent is used to find the first occurrence of consecutive elements that meet certain criteria.

Elements in an associative container are automatically sorted according to some ordering criteria.

The algorithm count_if counts the occurrences of a given value in a given range satisfying a certain criterion.

The statement ____ assigns 50 to the data member first of x.

The algorithm min is used to determine the minimum of two values.

The algorithm ____ is used to determine the largest element in a given range.

The algorithm ____ determines whether the elements in one range appear in another range.

The first form of ____ uses the equality criteria.