Solution: Associative containers refer to a group of class templates in the standard library of the C++ programming language that implements ordered associative arrays.

Solution: Associative containers are designed to be especially efficient in accessing its elements by their key, as opposed to sequence containers which are more efficient in accessing elements by their position.

Solution: There are 4 items presented in the associate container. They are set, multiset, map and multimap.

Solution: Both map and set only allow one instance of a key or element to be inserted into the container.

Solution: Bi-directional iterator are used to move in both direction from any element i.e. both forward and backward movements are allowed.

Solution: The STL is a generic library, meaning that its components are heavily parameterized.

Solution: All type of object does the container can be instantiated.

Solution: It is node-based because it allows for efficient insertion anywhere in the program.

Solution: Because they can manipulate the values on anywhere in the program, So it is providing random access.

Solution: Vector allows insertion of element at the end.