Q. Bubble sort is difficult to parallelize since the algorithm has no concurrency.
✅ Correct Answer: (A)
true
High Performance Computing MCQs | Page - 4
Dear candidates you will find MCQ questions of High Performance Computing here. Learn these questions and prepare yourself for coming examinations and interviews. You can check the right answer of any question by clicking on any option or by clicking view answer button.
Q. Quicksort is one of the most common sorting algorithms for sequential computers because of its simplicity, low overhead, and optimal average complexity.
✅ Correct Answer: (A)
true
Q. The performance of quicksort depends critically on the quality of the ______-.
✅ Correct Answer: (B)
pivot
Q. the complexity of quicksort is O(nlog n).
✅ Correct Answer: (A)
true
Q. The main advantage of ______ is that its storage requirement is linear in the depth of the state space being searched.
✅ Correct Answer: (B)
dfs
Q. _____ algorithms use a heuristic to guide search.
✅ Correct Answer: (A)
bfs
Q. If the heuristic is admissible, the BFS finds the optimal solution.
✅ Correct Answer: (A)
true
Q. The search overhead factor of the parallel system is defined as the ratio of the work done by the parallel formulation to that done by the sequential formulation
✅ Correct Answer: (A)
true
Q. The critical issue in parallel depth-first search algorithms is the distribution of the search space among the processors.
✅ Correct Answer: (A)
true
Q. Graph search involves a closed list, where the major operation is a _______
✅ Correct Answer: (C)
lookup
Jump to