High Performance Computing MCQs with answers Page - 26

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. In execution of the hypercube formulation of quicksort for d = 3, split along -----------dimention to partition sequence into two big blocks, one greater than pivot and other smaller than pivot as shown in diagram

  • (A) first
  • (B) scond
  • (C) third
  • (D) none of above

A

Admin • 833.24K Points
Coach

Q. Which Parallel formulation of Quick sort is possible

  • (A) shared-address-space parallel formulation
  • (B) message passing formulation
  • (C) hypercube formulation
  • (D) all of the above

A

Admin • 833.24K Points
Coach

Q. A complete graph is a graph in which each pair of vertices is adjacent

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

A

Admin • 833.24K Points
Coach

Q. The space required to store the adjacency matrix of a graph with n vertices is

  • (A) in order of n
  • (B) in order of n log n
  • (C) in order of n squared
  • (D) in order of n/2

A

Admin • 833.24K Points
Coach

Q. Graph can be represented by

  • (A) identity matrix
  • (B) adjacency matrix
  • (C) sprse list
  • (D) sparse matrix

A

Admin • 833.24K Points
Coach

Q. Simple backtracking is a depth-first search method that terminates upon finding the first solution.

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

A

Admin • 833.24K Points
Coach

Q. Best-first search (BFS) algorithms can search both graphs and trees.

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

A

Admin • 833.24K Points
Coach

Q. A* algorithm is a

  • (A) bfs algorithm
  • (B) dfs algorithm
  • (C) prims algorithm
  • (D) kruskals algorithm

A

Admin • 833.24K Points
Coach

Q. identify Load-Balancing Scheme/s

  • (A) asynchronous round robin
  • (B) global round robin
  • (C) random polling
  • (D) all above methods

A

Admin • 833.24K Points
Coach

Q. important component of best-first search (BFS) algorithms is

  • (A) open list
  • (B) closed list
  • (C) node list
  • (D) mode list

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.