Complete Modern C++ - Parallel Algorithms - I

The video tutorial introduces parallel STL algorithms in C++17, explaining how they differ from serial execution by utilizing multiple threads. It covers execution policies, which guide whether algorithms run sequentially or in parallel. The tutorial details three execution policies: sequenced, parallel, and parallel unsequenced, highlighting their roles in algorithm execution. It concludes with a list of algorithms parallelized in C++17 and examples of their usage.

What is the primary difference between default STL algorithms and their parallel versions introduced in C++17?

• Parallel versions do not use execution policies.

• Parallel versions are slower than serial versions.

• Parallel versions can execute on multiple threads.

• Parallel versions execute on a single thread.

What is the role of the execution policy in parallel STL algorithms?

• It defines the input parameters for the algorithm.

• It guides whether the algorithm should execute serially or parallelly.

• It specifies the memory allocation for the algorithm.

• It determines the data type of the algorithm.

Which of the following is NOT a type of execution policy in parallel STL algorithms?

• Parallel unsequenced policy

• Sequenced policy

• Parallel policy

• Concurrent policy

What does the parallel unsequenced policy allow in terms of execution?

• Execution only on a single thread

• Execution that is strictly sequential

• Execution without vectorization

• Execution that may be parallelized, vectorized, or migrated across threads

How does vectorization enhance the execution of parallel algorithms?

• By reducing the number of threads used

• By executing multiple instructions in parallel using special CPU instructions

• By increasing the memory usage

• By simplifying the algorithm's syntax