High Performance Computing MCQs with answers Page - 4

Here, you will find a collection of MCQ questions on High Performance Computing. Go through these questions to enhance your preparation for upcoming examinations and interviews.

To check the correct answer, simply click the View Answer button provided for each question.

Have your own questions to contribute? Click the button below to share your MCQs with others!

+ Add Question

A

Admin • 831.35K Points
Coach

Q. Quicksort is one of the most common sorting algorithms for sequential computers because of its simplicity, low overhead, and optimal average complexity.

  • (A) true
  • (B) false
  • (C) ---
  • (D) ---

A

Admin • 831.35K Points
Coach

Q. The performance of quicksort depends critically on the quality of the ______-.

  • (A) non-pivote
  • (B) pivot
  • (C) center element
  • (D) len of array

A

Admin • 831.35K Points
Coach

Q. the complexity of quicksort is O(nlog n).

  • (A) true
  • (B) false
  • (C) ---
  • (D) ---

A

Admin • 831.35K Points
Coach

Q. The main advantage of ______ is that its storage requirement is linear in the depth of the state space being searched.

  • (A) bfs
  • (B) dfs
  • (C) a and b
  • (D) none of above

A

Admin • 831.35K Points
Coach

Q. _____ algorithms use a heuristic to guide search.

  • (A) bfs
  • (B) dfs
  • (C) a and b
  • (D) none of above

A

Admin • 831.35K Points
Coach

Q. If the heuristic is admissible, the BFS finds the optimal solution.

  • (A) true
  • (B) false
  • (C) ---
  • (D) ---

A

Admin • 831.35K Points
Coach

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

  • (A) true
  • (B) false
  • (C) ---
  • (D) ---

A

Admin • 831.35K Points
Coach

Q. The critical issue in parallel depth-first search algorithms is the distribution of the search space among the processors.

  • (A) true
  • (B) false
  • (C) ---
  • (D) ---

A

Admin • 831.35K Points
Coach

Q. Graph search involves a closed list, where the major operation is a _______

  • (A) sorting
  • (B) searching
  • (C) lookup
  • (D) none of above

A

Admin • 831.35K Points
Coach

Q. Breadth First Search is equivalent to which of the traversal in the Binary Trees?

  • (A) pre-order traversal
  • (B) post-order traversal
  • (C) level-order traversal
  • (D) in-order traversal

Add MCQ in this Category

If you want to share an MCQ question in this category, it's a great idea! It will be helpful for many other students using this website.

Share Your MCQ

Browse Categories

Click on category to learn MCQs of that category.