High Performance Computing MCQs with answers Page - 43

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

Q. In Dijkstra's all pair shortest path each process compute the single-source shortest paths for all vertices assigned to it in SOURCE PARTITIONED FORMULATION

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

A

Admin • 802.91K Points
Coach

Q. 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

  • (A) a) and c)
  • (B) a) and b)
  • (C) b) and c)
  • (D) c) and d)

A

Admin • 802.91K Points
Coach

Q. M.J. Flynn's parallel processing classification is based on:

  • (A) multiple instructions
  • (B) multiple data
  • (C) both (a) and (b)
  • (D) none of the above

A

Admin • 802.91K Points
Coach

Q. In sorting networks for INCREASING COMPARATOR with input x,y select the correct output X', Y' from the following options

  • (A) x = min { x , y } and y = min { x , y }
  • (B) x = max { x , y } and y = min { x , y }
  • (C) x = min { x , y } and y = max{ x , y }
  • (D) x = max { x , y } and y = max { x , y }

A

Admin • 802.91K Points
Coach

Q. In sorting networks for DECREASING COMPARATOR with input x,y select the correct output X', Y' from the following options

  • (A) x = min { x , y } and y = min { x , y }
  • (B) x = max { x , y } and y = min { x , y }
  • (C) x = min { x , y } and y = max{ x , y }
  • (D) x = max { x , y } and y = max { x , y }

A

Admin • 802.91K Points
Coach

Q. Quicksort's performance is greatly affected by the way it partitions a sequence.

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

A

Admin • 802.91K Points
Coach

Q. CUDA thought that 'unifying theme' of every form of parallelism is

  • (A) cda thread
  • (B) pta thread
  • (C) cuda thread
  • (D) cud thread

A

Admin • 802.91K Points
Coach

Q. In ___________, the number of elements to be sorted is small enough to fit into the process's main memory.

  • (A) internal sorting
  • (B) internal searching
  • (C) external sorting
  • (D) external searching

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.