Exam 21: Standard Template Library (STL)

Input iterators,with read access,step forward element by element.

Random access iterators are ____ iterators that can randomly process the elements of a container.

The name of the class that implements the vector container is container.

All containers use the same names for the common operations.

The operator ____________________,supported by the stack container class,inserts a copy of item onto the stack.

____ is a modifying algorithm.

The container member function ____ returns the position of one past the last element in the container.

Some containers do not contain the member function end.

Every object in a(n)____ container has a specific position.

The associated header file of the sequence container multimap is ____________________.

____ is a nonmodifying algorithm.

____________________ predicates check a specific property for a pair-that is,two arguments.

____________________ iterators are forward iterators that can also iterate backward over the elements.

An iterator to a vector container is declared using the ____ iterator.

A container's ____ executes when the object goes out of scope.

The operator ____________________,supported by the queue container class,returns the next (i.e.,first)element in the queue,but does not remove the element from the queue.

Predicates are special types of function objects that return ____ values.

The first element in a vector container is at location 1.

List containers are implemented as doubly ____________________.

If data needs to be processed in a LIFO manner,use a ____.