High Performance Computing MCQs with answers Page - 24

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. While mapping Bitonic sort on Hypercube, Compare-exchange operations take place between wires whose labels differ in

  • (A) one bit
  • (B) two bits
  • (C) three bits
  • (D) four bits

A

Admin • 833.24K Points
Coach

Q. Which of following is NOT A WAY of mapping the input wires of the bitonic sorting network to a MESH of processes

  • (A) row major mapping
  • (B) column major mapping
  • (C) row major snakelike mapping
  • (D) row major shuffled mapping

A

Admin • 833.24K Points
Coach

Q. Which is the sorting algorithm in below given steps - 1. procedure X_SORT(n)
2. begin
3. for i := n - 1 downto 1 do
4. for j := 1 to i do
5. compare-exchange(aj, aj + 1);
6. end X_SORT

  • (A) selection sort
  • (B) bubble sort
  • (C) parallel selcetion sort
  • (D) parallel bubble sort

A

Admin • 833.24K Points
Coach

Q. The odd-even transposition algorithm sorts n elements in n phases (n is even), each of which requires ------------compare-exchange operations

  • (A) 2n
  • (B) n2
  • (C) n/2
  • (D) n

A

Admin • 833.24K Points
Coach

Q. What is TRUE about SHELL SORT

  • (A) moves elements only one position at a time
  • (B) moves elements long distance
  • (C) during second phase algorithm switches to odd even transposition sort
  • (D) both 2 and 3

A

Admin • 833.24K Points
Coach

Q. Which is the fastest sorting algorithm

  • (A) bubble sort
  • (B) odd-even transposition sort
  • (C) shell sort
  • (D) quick sort

A

Admin • 833.24K Points
Coach

Q. Pivot in Quick sort can be selected as

  • (A) always first element
  • (B) always last element
  • (C) always middle index element
  • (D) randomly selected element

A

Admin • 833.24K Points
Coach

Q. Quick sort uses Recursive Decomposition

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

A

Admin • 833.24K Points
Coach

Q. In first step of parallelizing quick sort for n elements to get subarrays, which of the following statement is TRUE

  • (A) only one process is used
  • (B) n processes are used
  • (C) two processes are used
  • (D) none of the above

A

Admin • 833.24K Points
Coach

Q. In Binary tree representation created by execution of Quick sort, Pivot is at

  • (A) leaf node
  • (B) root of tree
  • (C) any internal node
  • (D) none of the above

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.