Exam 21: Standard Template Library Stl

An STL algorithm cannot:

Iterators are similar to pointers because of the:

The algorithms in the STL:

Which of the following containers is not considered a near container?

The difference between functions partition and stable_partition is that:

Which of the following bitset member functions cannot be called with an empty argument list?

The easiest way to set all the values of a vector to zero is to use function:

Which of the following is the correct hierarchy of iterator categories weakest at the left)?

The for_each function applies a general function to each element in the specified range. This general function should:

The __________ function would produce the sequence 1, 5, 6 when passed the sequences 1, 2, 3, 4, 5, 6 and 2, 3, 4, 7 as first/second and third/fourth arguments, respectively.

Function template back_inserter returns:

The easiest way to search through a list of names and output the first one that begins with a vowel would be to use function:

Which of the following is a difference between vectors and arrays?

Data loss could occur if the contents of a __________ were placed into any of the other three associative container types.

The expression std::multimap< int, double, std::less< int > >::value_type 15, 2.7 ):

Class deque provides:

Function mismatch returns:

Function objects have their functions called by using:

Which of the following is not a sequence container provided by the STL?

If v1 is a vector< int > containing some number of int elements sorted in ascending order, after these statements execute: Std::vector< int > results1; Std::vector< int > results2; Std::unique_copy v1.begin), v1.end), std::back_inserter results1 ) ); Std::reverse_copy v1.begin), v1.end), std::back_inserter results2 ) ); Which of the following could be true?