Answer the following statements true (T) or false (F)

Question

1. STL set operations are essentially insert, delete, and the query, “Is it there?”.
2. A Map is a function given as a set of ordered pairs. The first is the key that has to have ordering and the second is any type. The position of a pair in the set is determined by the ordering on the keys.
3. The set container implements only iterator.
4. Order of magnitude estimates don’t work well if we are interested in behavior for small data sets.
5. Nonmodifying sequence algorithms do not change the elements in the containers they work on.

Answer 1

1. True
2. True
3. False
The set container defines the full panoply of containers: iterator, const_iterator, reverse_iterator, and const_reverse_iterator, all bidirectional.
4. True
Big O estimates are useful for big values of N – in fact growing values of N. Frequently, when making big O estimates, constant terms and lower order terms (terms with exponent smaller than the highest present) will be neglected. These terms have little effect for large enough N, but strongly affect the result for small N.
5. True
Etymologically, that is what nonmodifying means. Here, more specifically, it means an algorithm that reads but does not write the elements in the container.