Why Study with PlanetCert?
The Latest Questions
Practice questions and exam topics aligned with the current exam objectives.
Detailed Explanations
Go beyond the answer. Master the material with comprehensive learning and professional explanations for every concept.

AI-Powered Insights
Personalized preparation guidance that adapts to your performance and identifies weak spots automatically.
Exam Information
Official specifications published by C++ Institute
Exam Format
Registration
Validity
Skills this practice test covers
- Choose between std::vector, std::deque and std::list, and use the stack, queue and priority_queue adapters.
- Insert, find and erase elements in std::set, std::multiset, std::map and std::multimap.
- Search, count, copy, transform and remove elements with the STL sequence algorithms.
- Sort ranges and run binary search, merge and set algorithms on sorted data.
- Format stream output with setf, unsetf and manipulators such as setprecision and setw.
- Write function templates, class templates and template specializations.
Explore related topics
CPP exam content
9 domains · 0 topics · 111 of 151 questions sorted by domain
Sequence Containers and Container Adapters13 questions
This block covers std::vector, std::deque and std::list, and the container adapters std::queue, std::priority_queue and std::stack. Candidates insert, delete and access elements with member functions and iterators, using both built-in and user-defined types.
Skills tested
- Pick between std::vector, std::deque and std::list for a described task.
- Use std::stack, std::queue and std::priority_queue, including a custom comparator.
- Traverse containers with iterators and know which calls invalidate them.
- Store user-defined types in containers and reach them through member functions.
Associative Containers15 questions
This block covers std::set, std::multiset, std::map and std::multimap. Candidates insert, find, erase and traverse elements, and store user-defined keys, which need a valid ordering.
Skills tested
- Choose between set and multiset, or map and multimap, for a data model.
- Tell what insert and operator[] each do when a std::map already holds the key.
- Use equal_range to read all values for one key in a std::multimap.
- Define the comparison that a user-defined key type needs.
Algorithms: Non-Modifying Sequence Operations12 questions
This block covers algorithms that read a range without changing it. Candidates use std::for_each, the find and search family, std::count and std::count_if, and std::mismatch and std::equal to compare ranges.
Skills tested
- Apply std::for_each to run an operation on every element of a range.
- Locate elements with std::find_if, std::find_end, std::adjacent_find and std::search_n.
- Count matching elements with std::count_if and a predicate.
- Read the pair of iterators that std::mismatch returns.
Algorithms: Modifying Sequence Operations15 questions
This block covers algorithms that write to a range: copy, fill and generate, swap and transform, replace and remove, and reverse, rotate and partition. A common trap is that std::remove does not shrink the container, so the erase-remove idiom is needed.
Skills tested
- Copy and fill ranges with std::copy_backward, std::fill_n and std::generate_n.
- Transform elements in place or into a second range with std::transform.
- Delete elements correctly with std::remove_if and the erase-remove idiom.
- Rearrange elements with std::rotate, std::partition and std::stable_partition.
Algorithms: Sorting and Binary Search15 questions
This block covers std::sort and std::stable_sort with default or custom comparison, and the binary searches std::lower_bound, std::upper_bound and std::binary_search. A binary search only works on a range sorted by the same rule it uses.
Skills tested
- Sort with a custom comparator and say when std::stable_sort keeps equal elements in order.
- Find the first and last positions of a value with std::lower_bound and std::upper_bound.
- Check that a range is sorted by the same comparison before a binary search.
Algorithms: Merge, Heap, Min, Max13 questions
This block covers std::merge and std::inplace_merge, the set algorithms such as std::set_union and std::set_intersection, and std::min_element and std::max_element. The merge and set algorithms expect sorted input ranges.
Skills tested
- Combine two sorted ranges with std::merge, or two sorted halves with std::inplace_merge.
- Find shared and differing elements with the set algorithms, including std::set_symmetric_difference.
- Locate the smallest and largest elements with std::min_element and std::max_element.
STL Functional Objects and Utilities9 questions
This block covers the standard function objects, such as std::plus and std::minus, used with algorithms like std::transform. It also names std::ptr_fun and other function adapters, which bind functions for use with algorithms.
Skills tested
- Pass std::plus, std::minus and other standard function objects to std::transform.
- Adapt a function for an algorithm with std::ptr_fun and other function adapters.
- Rewrite an older adapter call as a lambda expression.
Advanced I/O8 questions
This block covers stream objects such as std::cout, std::cin and std::cerr, format flags set with setf and unsetf, and manipulators like boolalpha, noshowpoint, setprecision, fixed and setw. Most manipulators stay in effect until changed, but setw applies only to the next output.
Skills tested
- Set and clear format flags with setf and unsetf.
- Format numbers with fixed, setprecision and noshowpoint.
- Align output with setw, and print bool values as words with boolalpha.
Templates11 questions
This block covers function templates and their specializations, class templates instantiated with different types, and template classes nested inside other template classes. Candidates also use operator functions from other classes inside template classes.
Skills tested
- Write a function template and a specialized version for one type.
- Define a class template and instantiate it with several data types.
- Declare and use a template class inside another template class.
- Use the typename keyword for dependent types inside a template.
Requirements
- No formal prerequisites: anyone can book the exam.
- Recommended: the CPA – C++ Certified Associate Programmer certification first.
- Recommended: two or more years of professional C++ programming, with good knowledge of the standard library.
- Recommended: a solid grasp of object-oriented programming principles.
About the CPP exam
The CPP exam from the C++ Institute tests advanced use of the C++ Standard Template Library (STL): containers, iterators, algorithms, function objects, stream formatting and templates. Its nine blocks name the exact classes and functions in scope, from std::deque to std::set_symmetric_difference. Passing it earns the C++ Certified Professional Programmer certification, the professional level above CPA, and it does not expire.
Many PlanetCert practice questions ask what a call returns or leaves behind, such as the size of a vector after std::remove, or the element that std::lower_bound finds. The explanations trace each step, which helps with traps such as manipulators that stay set, or a binary search on data sorted by a different rule. A smaller set of questions covers smart pointers and other modern C++ features, which the certification overview names alongside the STL. Brainy AI Assistant can explain an unfamiliar algorithm or rework an example with a different container.
How to earn the certification
- Earns
- C++ Certified Professional Programmer (CPP)Professional
CPP is a lifetime certification with no renewal step.
- Before
- CPA-21-02 CPA – C++ Certified Associate Programmer
Recommended first. It covers the core language and object-oriented programming that CPP builds on.
- CPA-21-02 CPA – C++ Certified Associate Programmer
How to prepare for CPP
- 1
Keep the official block list open
The C++ Institute's syllabus names every class, algorithm and manipulator in scope. Tick each one off after writing a short program that uses it.
- 2
Predict the output, then compile
Before running each snippet, write down what it should print. Each mismatch shows which rule, such as iterator invalidation or a manipulator that stays set, needs another look.
- 3
Drill sorted-range preconditions
Binary search, merge and set algorithms assume sorted input. Practise with ranges sorted by a custom comparator, and check that the search uses the same rule.
- 4
Rewrite old adapters with lambdas
Block 7 names std::ptr_fun and other function adapters. Write each example with the adapter, then again with a lambda expression, so both forms read easily.
- 5
Time the full CPP practice test
Take the CPP practice test in Timed Mode once all nine blocks are covered. Review each missed question with its explanation, and ask Brainy AI Assistant to walk through the code line by line.
Start a timed CPPrun
The C++ Institute lists C++ Advanced on Cisco Networking Academy and the C++ Advanced course on the OpenEDG Edube learning platform.
Who CPP is for
- C++ developers who use STL containers and algorithms every day and want a formal credential.
- Holders of CPA who want the professional-level C++ Institute certification.
- Embedded, game and systems programmers whose code depends on predictable container behavior.
- Technical leads who review C++ code that relies on the standard library.
Typical job titles: C++ developer · Software engineer · Systems programmer · Game developer · Embedded systems developer · Application developer
CPP glossary
18 terms from the exam objectives and the vendor's official material, each defined in a sentence.
- boolalpha
- A stream manipulator that prints and reads bool values as true and false instead of 1 and 0.
- Container adapters
- Classes such as std::stack, std::queue and std::priority_queue that give a limited interface on top of another container.
- Erase-remove idiom
- Calling a container's erase on the range that std::remove or std::remove_if returns, so the unwanted elements are really deleted.
- Function objects
- Objects that can be called like functions, such as std::plus, and are often passed to algorithms.
- Iterators
- Objects that point to elements in a container and move through them, which lets algorithms work with any container.
- Minimally Qualified Candidate (MQC)
- The C++ Institute's profile of the least-prepared candidate who should still pass the exam.
- Nested templates
- Template classes declared and used inside other template classes.
- setprecision
- A stream manipulator that sets how many digits a floating-point value shows; with fixed, it counts the digits after the point.
- Standard Template Library (STL)
- The part of the C++ standard library that provides containers, iterators, algorithms and function objects.
- std::deque
- A double-ended queue: a sequence container with fast insertion and removal at both the front and the back.
- std::inplace_merge
- An algorithm that merges two sorted parts that sit next to each other in one range into a single sorted range.
- std::lower_bound
- A binary search that returns the first position where a value could be inserted without breaking the sort order.
- std::multimap
- An ordered associative container of key-value pairs in which one key can appear more than once.
- std::priority_queue
- A container adapter that always gives access to its largest element first, or to the first element by a custom comparison.
- std::ptr_fun
- An older function adapter that wraps a plain function pointer so that algorithms and binders can use it.
- std::set_symmetric_difference
- An algorithm that copies the elements found in one sorted range or the other, but not in both.
- std::stable_sort
- A sort that keeps equal elements in their original order.
- Template specialization
- A separate definition of a template for one specific type, used instead of the general version.