Introduction to iterators

We can view a container as a sequence of elements; the sequence's end is conventionally defined as:

In the standard template library model, algorithms and containers interact through which data structure? Select the best response.

In the standard template library model,   manipulate data, but don’t know about containers. Select the best response that fills in the blank.

In the standard template library model,   store data, but do not know about algorithms.

In the standard template library model, a pair of   defines a sequence and allow us to iterate through different types of containers the same way.

Most iterator types provide three common behaviors. Which iterator operation allows access to the element we're currently visiting?

Most iterator types provide three common behaviors. Which iterator operation moves an iterator to the next element in the sequence?

Most iterator types provide three common behaviors. Which iterator operation is used to check whether two iterators are at the same element?

An iterator is an abstraction of a(n)  . Select the best response that fills in the blank.

true, or false: no iterator type supports any operation(s) other than those listed below.

• access to the element we're currently visiting,
• move to the next element in the sequence, and
• check whether two iterators are visiting the same element