C++ Standard Template Library

C++ Standard Template Library

Master STL and increase your C++ language knowledge through case studies and exercises.

Duration
31 hours
Course type
Online
Language
English
Duration
31 hours
Location
Online
Language
English
Code
C-007
Training for 7-8 or more people? Customize trainings for your specific needs
C++ Standard Template Library
Duration
31 hours
Location
Online
Language
English
Code
C-007
€ 750 *
Training for 7-8 or more people? Customize trainings for your specific needs

Description

This training is a deep dive into the Standard Template Library components such as functions, containers, algorithms and iterators. You will discover how you can simplify your code and get to know the philosophy behind C++.


With the help of 19 practice sessions, you will have the opportunity to exercise what you learn and be able to solve some common interview problems in a C++ way and answer common interview questions.

certificate
After completing the course, a certificate
is issued on the Luxoft Training form

Objectives

  • Familiarize yourself with the STL tools
  • Learn how to use STL classes and utilities
  • Know the cost of used tools
  • How to write code with modern C++
  • Understand the STL philosophy

Target Audience

  • C++ Developers (Junior/Regular/Senior)
  • C Developers (Regular/Senior)

Prerequisites

  • Basic knowledge of C++
  • Basic knowledge of CMake, GTest, Git

Roadmap

Methodology overview

Functional objects

  • Generic programming and callable objects
  • Functions relation with STL
  • Transformations between different function types (function adaptors)


Containers

  • Contains visual representation, implementation details, use cases, corner cases, and operations overview for all containers
  • Container classification is given and explained
  • Sequence containers: Common, Vector, List, Forward list, Deque
  • Container adaptors
  • Ordered associative
  • Unordered associative
  • Pseudo containers


Iterators

  • Iterator model, classes, properties and operations are investigated
  • Implementation for stream iterators and iterator adaptors


Algorithms overview

Non-modifying algorithms

Modifying algorithms

Sorting and searching

Numeric

Still have questions?
Connect with us