Scribd
Upload
9 views8 pages

Experiment 12

Uploaded by

ravjidborkar.22co66
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
9 views8 pages

Experiment 12

Uploaded by

ravjidborkar.22co66
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 8

Page No.

Experiment No.:12 Date:__________


Aim : To study standard template library (STL)

Theory:

STL comprises several key components:

● Containers: These are data structures that store collections of objects.


Containers are broadly classified into several types, including:
○ Sequence Containers: These maintain the order of elements and
allow access via sequential iteration. Examples include vector, deque,
and list.
○ Associative Containers: These store elements formed as key-value
pairs, enabling efficient retrieval based on keys. They include set, map,
multiset, and multimap.
○ Unordered Containers: These provide average constant time
complexity for insertions and lookups by using hash tables. Examples
are unordered_set and unordered_map.
● Iterators: Iterators act as pointers that provide a uniform way to traverse the
elements of containers. They enable the manipulation of container elements
in a consistent manner, regardless of the underlying data structure. The STL
defines several iterator types, including input iterators, output iterators,
forward iterators, bidirectional iterators, and random-access iterators.
● Algorithms: The STL includes a rich library of algorithms that can operate on
the elements of containers. These algorithms cover a wide range of
operations such as searching, sorting, transforming, and manipulating data.
They are designed to work seamlessly with iterators, enabling powerful and
flexible data processing capabilities.
● Functors: Functors are objects that can be called as if they are functions. In
the context of the STL, functors enable custom behavior in algorithms,
allowing users to define specific operations for sorting or searching based on
their requirements.

2. Benefits of Using STL

● Efficiency: STL provides well-optimized algorithms and data structures,


improving the performance of software applications. The efficiency of these
components often rivals hand-crafted implementations.
● Reusability: By leveraging templates, STL allows developers to write generic
code that works with any data type. This enhances code reusability and
reduces redundancy.
● Maintainability: STL promotes clean and readable code by abstracting
complex operations and data structures. The use of standardized interfaces
makes it easier for developers to understand and maintain codebases.
● Portability: Being part of the C++ Standard Library, STL is portable across
different platforms and compilers, ensuring consistency in behavior and
performance.

STL Name Roll No


Page No.

3. Complexity and Performance

STL components come with well-defined performance characteristics, often


expressed in terms of time complexity. Understanding these complexities is crucial
for selecting the appropriate container or algorithm based on the application's needs.
For instance, operations such as insertion, deletion, and lookup have varying
complexities across different container types, influencing the choice of data
structures for specific use cases.

4. Customizing STL Components

STL allows for customization through the use of user-defined types, enabling
developers to create specialized containers, iterators, and algorithms. By
overloading operators and implementing required interfaces, custom types can
seamlessly integrate with the STL.

STL Name Roll No


Page No.

Program 12[A]:Write a C++ program to implement standard library vector sequence


container

Program: Output:

STL Name Roll No


Page No.

Program 12[B]:Write a C++ program to implement standard library list sequence


container
Program: Output:

STL Name Roll No


Page No.

Program 12[C]:Write a C++ program to implement standard library deque sequence


container

Program: Output:

STL Name Roll No


Page No.

Program 12[D]:Write a C++ program to implement standard library stack adapter


class

Program: Output:

STL Name Roll No


Page No.

Program 12[E]:Write a C++ program to implement standard library queue adapter


class template

Program: Output:

STL Name Roll No


Page No.

Program 12[F]:Your code

Program: Output:

Conclusion:

STL Name Roll No

You might also like