Search for Training

C++ Standard Template Library

Course Overview


The C++ Standard Template Library explains the key attributes of generic, component-based software development, and how the C++ Standard Template Library supports this approach.It covers all major features of the library, including its collection classes, algorithms, iterators, and function objects. The C++ Standard Template Library course is case-study oriented, developing a variety of small, but useful programs using the C++ Standard Template Library, often showing the same program written in a variety of different ways. In addition, the course is extremely hands on: students are given a variety of assignments to develop programs using library features.

Course Content


C++ Standard Template Library Features and Benefits

  • Why the STL is important
  • Primary uses
  • The key components of the STL
  • Current status

Iterators

  • Input and output iterators
  • Iterators and streams
  • Forward iterators
  • Bidirectional and random-access iterators
  • Iterators and pointers
  • Iterator adaptors
  • Insert, back, and front iterators

Container Basics

  • Commonalities among containers
  • Contained defined types
  • Iterator-creating operations
  • Copying and assigning containers

Sequence Containers

  • An overview of vectors
  • Vector constructors
  • Vectors and space allocation
  • Inserting and deleting elements
  • Vectors and iterators
  • Deques
  • How deques are implemented
  • Deques and iterators
  • Lists
  • List-specific operations

Sorted Associative Containers

  • Specifying element ordering
  • Sets
  • Inserting and deleting set elements
  • Multisets
  • Specialized set and multiset operations
  • Maps
  • Key-based access
  • Subscript-based access
  • Multimaps

Sequence Adaptors

  • Stacks
  • Queues
  • Priority Queues

Sequential Algorithms

  • Read-only operations
  • Counting algorithms
  • Locating elements and subsequences
  • Modifying algorithms
  • Placing values in sequences
  • Copying and replacing elements
  • Transforming collections
  • Removing algorithms

Order-Related Algorithms

  • Reversing and rotating algorithms
  • Random ordering and permutations
  • Sorting algorithms
  • Binary search
  • Set algorithms
  • Heap algorithms

Numeric Algorithms

  • Accumulation
  • Partial sums
  • Adjacent difference
  • Inner products
  • Minimums and maximums

Function Objects

  • Types of function objects
  • Comparison objects
  • Predicates
  • Function adaptors
  • Binders and negators

Tips

  • Simplifying STL's Use
  • Using STL efficiently in terms of time
  • Using STL efficiently in terms of space
  • Hiding STL's use
  • Extending STL

Customer Reviews


Thanks to Xpertised and the tutor who walked me through all the topics with Practical exposure which is helping me in my current project.
-Waseem

Course was quite helpful in terms of understanding of concepts and practicality. Its really a very friendly environment to learn. The timing were mutually chosen, as we both are working professional. I am quite satisfied with the course.
-Tanmoy

...more
Share:

For Batch Details
Call us at: +91 7259222234

Not sure? Consult Our Experts

What is the sum of 1 + 6? (security question)

Looking for a Training for

Myself

My Team/Organization

I agree to be contacted over mail or phone

or
Call us at: +91 7259222234


Our Initiatives

ExpertsCertify - Skill Assessment And Tests
AreuCertified - Certification Training
Xpertised IT Solutions - Custom Application Development
Xpertised Learning - Redefine Skills

Subscribe to our weekly newsletter

Batch Details
  Request a Callback
Call us at: +91 7259222234