Complete Modern C++ - Parallel Algorithms - III

Why might a sequential algorithm be faster than a parallel one for small datasets?

• The overhead of initializing threads can outweigh the benefits.

• Parallel algorithms always outperform sequential ones.

• Sequential algorithms use more memory.

• Parallel algorithms are not compatible with small datasets.

What happens when an exception is thrown during the execution of a parallel algorithm?

• The program terminates.

• The exception is ignored.

• The exception is automatically handled.

• The program continues execution.

Why are non-parallel versions still required in the standard library?

• They use less memory.

• They are needed for backward compatibility.

• They are faster for all datasets.

• They are easier to implement.

Which of the following algorithms cannot be parallelized?

• Bubble sort

• Shuffle

• Quick sort

• Merge sort

What is a potential drawback of using parallel algorithms?

• They require more memory than available.

• They cannot handle any exceptions.

• They are always slower than sequential algorithms.

• They may require expensive synchronization.