High Performance Computing MCQs with answers Page - 9

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 • 833.24K Points
Coach

Q. which problems can be handled by recursive decomposition

  • (A) backtracking
  • (B) greedy method
  • (C) divide and conquer problem
  • (D) branch and bound

A

Admin • 833.24K Points
Coach

Q. In this decomposition problem decomposition goes hand in hand with its execution

  • (A) data decomposition
  • (B) recursive decomposition
  • (C) explorative decomposition
  • (D) speculative decomposition

A

Admin • 833.24K Points
Coach

Q. which of the following is not an example of explorative decomposition

  • (A) n queens problem
  • (B) 15 puzzal problem
  • (C) tic tac toe
  • (D) quick sort

A

Admin • 833.24K Points
Coach

Q. Topological sort can be applied to which of the following graphs?

  • (A) undirected cyclic graphs
  • (B) directed cyclic graphs
  • (C) undirected acyclic graphs
  • (D) directed acyclic graphs

A

Admin • 833.24K Points
Coach

Q. In most of the cases, topological sort starts from a node which has __________

  • (A) maximum degree
  • (B) minimum degree
  • (C) any degree
  • (D) zero degree

A

Admin • 833.24K Points
Coach

Q. Which of the following is not an application of topological sorting?

  • (A) finding prerequisite of a task
  • (B) finding deadlock in an operating system
  • (C) finding cycle in a graph
  • (D) ordered statistics

A

Admin • 833.24K Points
Coach

Q. In ------------task are defined before starting the execution of the algorithm

  • (A) dynamic task
  • (B) static task
  • (C) regular task
  • (D) one way task

A

Admin • 833.24K Points
Coach

Q. which of the following is not the array distribution method of data partitioning

  • (A) block
  • (B) cyclic
  • (C) block cyclic
  • (D) chunk

A

Admin • 833.24K Points
Coach

Q. blocking optimization is used to improve temmporal locality for reduce

  • (A) hit miss
  • (B) misses
  • (C) hit rate
  • (D) cache misses

A

Admin • 833.24K Points
Coach

Q. Topological sort of a Directed Acyclic graph is?

  • (A) always unique
  • (B) always not unique
  • (C) sometimes unique and sometimes not unique
  • (D) always unique if graph has even number of vertices

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.