Use this quick start guide to collect all the information about C++ Institute CPP Certified Professional Programmer (CPP-22-02) Certification exam. This study guide provides a list of objectives and resources that will help you prepare for items on the CPP-22-02 CPP - C++ Certified Professional Programmer exam. The Sample Questions will help you identify the type and difficulty level of the questions and the Practice Exams will make you familiar with the format and environment of an exam. You should refer this guide carefully before attempting your actual C++ Institute CPP - C++ certification exam.
The C++ Institute CPP Certified Professional Programmer certification is mainly targeted to those candidates who want to build their career in C++ Programming domain. The CPP - C++ Certified Professional Programmer exam verifies that the candidate possesses the fundamental knowledge and proven skills in the area of C++ Institute CPP - C++.
C++ Institute CPP Certified Professional Programmer Exam Summary:
| Exam Name | CPP - C++ Certified Professional Programmer |
| Exam Code | CPP-22-02 |
| Exam Price | $295 (USD) |
| Duration | 65 mins |
| Number of Questions | 40 |
| Passing Score | 70% |
| Books / Training |
C++ Advanced – Cisco Networking Academy (Go to Cisco NetAcad) C++ Advanced (Advanced) – OpenEDG Learning Platform (Go to OpenEDG Edube) |
| Schedule Exam | Pearson VUE |
| Sample Questions | C++ Institute CPP Certified Professional Programmer Sample Questions |
| Practice Exam | C++ Institute CPP-22-02 Certification Practice Exam |
C++ Institute CPP-22-02 Exam Syllabus Topics:
| Topic | Details | Weights |
|---|---|---|
| Sequence Containers and Container Adapters |
- Identify and explain the purpose and characteristics of sequence containers: std::vector, std::deque, std::list. - Identify and explain the purpose and characteristics of container adapters: std::queue, std::priority_queue, std::stack. - Apply standard methods of vector, deque, list, queue, priority_queue, and stack for common operations (e.g., insertion, deletion, access). - Use iterators to traverse and access elements in sequence containers and adapters. - Manipulate sequence containers with both simple (built-in) and complex (user-defined) data types. - Access and modify container elements using member functions and iterator-based approaches. Scope & Keywords: std::vector, std::deque, std::list, std::queue, std::priority_queue, std::stack, container adapters, iterators, element access, insertion and removal methods, use with user-defined types. |
13.25% |
| Associative Containers |
- Identify and explain the characteristics and use cases of associative containers: std::set, std::multiset, std::map, std::multimap. - Apply standard methods of set, multiset, map, and multimap for insertion, deletion, search, and data retrieval. - Use associative containers with both simple (built-in) and complex (user-defined) data types. - Traverse associative containers using iterators and access stored data. - Perform operations on container elements using container-specific member functions and iterators. Scope & Keywords: std::set, std::multiset, std::map, std::multimap, insertion, deletion, search, iterators, key-value pairs, use with user-defined types. |
13.25% |
| Algorithms: Non-Modifying Sequence Operations |
- Explain the purpose of non-modifying sequence algorithms and their use cases in iterating over containers. - Apply std::for_each to iterate over a range of elements and perform an operation on each element. - Use searching algorithms such as std::find, std::find_if, std::find_end, std::find_first_of, std::adjacent_find, std::search, and std::search_n to locate elements within containers. - Apply counting algorithms std::count and std::count_if to count elements based on specified criteria. - Use comparison algorithms std::mismatch and std::equal to compare ranges of elements in containers. Scope & Keywords: std::for_each, std::find, std::find_if, std::find_end, std::find_first_of, std::adjacent_find, std::search, std::search_n, std::count, std::count_if, std::mismatch, std::equal, iteration, searching, comparing ranges. |
13.25% |
| Algorithms: Modifying Sequence Operations |
- Apply algorithms for generating and copying data, including std::copy, std::copy_backward, std::fill, std::fill_n, std::generate, and std::generate_n. - Use swapping and transformation algorithms such as std::swap_ranges, std::swap, std::iter_swap, and std::transform to manipulate container elements. - Apply replacement and removal algorithms, including std::replace, std::remove, std::remove_if, std::unique, and std::unique_copy, to modify container contents. - Use sequence-reordering algorithms such as std::reverse, std::reverse_copy, std::rotate, std::partition, and std::stable_partition for rearranging elements in containers. Scope & Keywords: std::copy, std::fill, std::generate, std::swap, std::transform, std::replace, std::remove, std::unique, std::reverse, std::rotate, std::partition, modifying container elements, removing duplicates, rearranging sequences. |
13.25% |
| Algorithms: Sorting and Binary Search |
- Apply sorting algorithms std::sort and std::stable_sort to arrange elements in ordered sequences based on default or custom comparison criteria. - Use binary search algorithms, including std::lower_bound, std::upper_bound, and std::binary_search, to search for elements in sorted containers efficiently. Scope & Keywords: std::sort, std::stable_sort, std::lower_bound, std::upper_bound, std::binary_search, sorting algorithms, binary search, sorted containers, custom comparison functions. |
16.5% |
| Algorithms: Merge, Heap, Min, Max |
- Apply merging algorithms such as std::merge and std::inplace_merge to combine sorted sequences into a single sorted sequence. - Use set operations on sorted sequences, including std::includes, std::set_union, std::set_intersection, std::set_difference, and std::set_symmetric_difference. - Apply algorithms for finding minimum and maximum elements in a range, including std::min_element and std::max_element. Scope & Keywords: std::merge, std::inplace_merge, std::includes, std::set_union, std::set_intersection, std::set_difference, std::set_symmetric_difference, std::min_element, std::max_element, merging sorted sequences, set operations, min/max search. |
16.5% |
| STL Functional Objects and Utilities |
- Apply STL functional objects such as std::plus, std::minus, and other standard function objects with algorithms like std::transform. - Use std::ptr_fun and other function adapters to bind functions for use with algorithms. Scope & Keywords: std::plus, std::minus, std::transform, std::ptr_fun, functional objects, function adapters, algorithm utilities. |
7% |
| Advanced I/O |
- Apply advanced input/output operations using stream objects such as std::cout, std::cin, and std::cerr. - Use stream format flags with setf and unsetf methods to control I/O behavior and appearance. - Apply stream manipulators such as boolalpha, noshowpoint, setprecision, fixed, and setw to format output. Scope & Keywords: std::cout, std::cin, setf, unsetf, boolalpha, noshowpoint, setprecision, fixed, setw, stream manipulators, formatting output. |
7% |
| Templates |
- Define template functions and specialized template functions for generic programming. - Define template classes and instantiate them with various data types. - Use functions and operator functions from other classes with template classes. - Declare and use template classes inside other template classes (nested templates). Scope & Keywords: template functions, function templates, class templates, template specialization, nested templates, operator overloading with templates. |
7% |
To ensure success in C++ Institute CPP - C++ certification exam, we recommend authorized training course, practice test and hands-on experience to prepare for CPP - C++ Certified Professional Programmer (CPP-22-02) exam.