McqMate

Q. |
## Suppose there are 16 elements in a series then how many phases will be required to sort the series using parallel odd-even bubble sort? |

A. | 8 |

B. | 4 |

C. | 5 |

D. | 15 |

Answer» D. 15 |

3.3k

0

Do you find this helpful?

26

View all MCQs in

High Performance Computing (HPC)No comments yet

- The complexity of bubble sort is Θ(n2).
- Bubble sort is difficult to parallelize since the algorithm has no concurrency.
- Given an array of n elements and p processes, in the message-passing version of the parallel quicksort, each process stores ---------elements of array
- What is is the ratio of the time taken to solve a problem on a single processor to the time required to solve the same problem on a parallel computer with p identical processing elements?
- The ratio of the time taken to solve a problem on a parallel processors to the time required to solve the same problem on a single processor with p identical processing elements.
- The odd-even transposition algorithm sorts n elements in n phases (n is even), each of which requires ------------compare-exchange operations
- In parallel Quick Sort Pivot is sent to processes by
- In parallel Quick Sort each process divides the unsorted list into
- In parallel quick sort Pivot selecton strategy is crucial for
- Which Parallel formulation of Quick sort is possible