Coupon Accepted Successfully!



1.     The STL is a new expansion in C++ l­anguage. The all-famous compiler vendors give the STL as a feature of their compilers.

2.     The Meng Lee and Alexander Stepanov of Hewlett Packard introduced the STL.

3.     The STL is portative between different operating systems. The STL contents are defined in the namespace std.

4.     The important subdivisions are as follows: (A) Containers, (B) Algorithms, (C) ­Iterators.

5.     A container is an object that holds data or other objects. An algorithm is a process that is useful to handle the data stored in containers. The STL consists of by-guess 60 standard algorithms that give support to perform frequent and primary operations such as copying, finding, sorting, merging, and initializing.

6.     An iterator is an object that is treated as a pointer. It indicates or points to data elements in a container. It is utilized to move between the data of containers.

7.     The standard C++ library has a sequence of container classes. The container classes are robust and support C++ programmers in controlling common programming ­operations.

8.     Sequence containers hold data elements in a linear series.

9.     We know that an array is used to store similar data elements. The data elements are stored in continuous memory locations. The container class vector is similar to an ­array.

10.   A vector container class is accelerated to allow quick access to its elements in ­sequence.

11.   The list container allows the programmer the usual insertion and deletion of items. It is defined in header file <list>. It acts as a double-linked list.

12.   A deque is similar to a multiple-ended vector. It has the ability similar to a vector class to perform sequential read and write operations. The deque class allows improved front-end and back-end operations.

13.   The stack, queue, and priority queues are called container adaptors. All these container adaptors can be produced from unlike sequence containers.

14.   Algorithms are independent template functions. They are not member or friend functions. They enable the programmer to manipulate the data stored in various containers. Each container has its functions for performing common operations.

15.   Iterator acts as pointers. They are used for accessing contents of container classes.

16.   The vector is a more useful container. Similar to an array, it stores elements in neighboring memory locations. Each can be directly accessed using the operator[]. A vector is able to enlarge its size if an extra element is assigned to it.

17.   The list is a frequently used feature. It allows a bi-directional linear list. Elements can be inserted or deleted at both the ends.

18.      A map is a series of pairs of key names and values associated with it.

Test Your Skills Now!
Take a Quiz now
Reviewer Name