McqMate

Q. |
## Bubble sort is difficult to parallelize since the algorithm has no concurrency. |

A. | true |

B. | false |

Answer» A. true |

1.4k

0

Do you find this helpful?

13

View all MCQs in

High Performance Computing (HPC)No comments yet

- 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?
- to solve the all-pairs shortest paths problem which algorithm's is/are used a) Floyd's algorithm b) Dijkstra's single-source shortest paths c) Prim's Algorithm d) Kruskal's Algorithm
- The complexity of bubble sort is Θ(n2).
- Average Degree of Concurrency is...
- A feature of a task-dependency graph that determines the average degree of concurrency for a given granularity is its ___________ path?
- _________ is a method for inducing concurrency in problems that can be solved using the divide-and-conquer strategy?
- What is the worst case time complexity of a quick sort algorithm?
- What is the average running time of a quick sort algorithm?
- In most of the cases, topological sort starts from a node which has __________
- Topological sort can be applied to which of the following graphs?