High Performance Computing MCQs with answers Page - 25

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. What is the average running time of a quick sort algorithm?

  • (A) o(n)
  • (B) o(n log n)
  • (C) o(n2)
  • (D) o(log n)

A

Admin • 833.24K Points
Coach

Q. Odd-even transposition sort is a variation of

  • (A) quick sort
  • (B) shell sort
  • (C) bubble sort
  • (D) selection sort

A

Admin • 833.24K Points
Coach

Q. What is the average case time complexity of odd-even transposition sort?

  • (A) o(n log n)
  • (B) o(n)
  • (C) o(log n)
  • (D) o(n2)

A

Admin • 833.24K Points
Coach

Q. Shell sort is an improvement on

  • (A) quick sort
  • (B) bubble sort
  • (C) insertion sort
  • (D) selection sort

A

Admin • 833.24K Points
Coach

Q. In parallel Quick Sort Pivot is sent to processes by

  • (A) broadcast
  • (B) multicast
  • (C) selective multicast
  • (D) unicast

A

Admin • 833.24K Points
Coach

Q. In parallel Quick Sort each process divides the unsorted list into

  • (A) n lists
  • (B) 2 lists
  • (C) 4 lists
  • (D) n-1 lists

A

Admin • 833.24K Points
Coach

Q. Time Complexity of DFS is? (V – number of vertices, E – number of edges)

  • (A) o(v + e)
  • (B) o(v)
  • (C) o(e)
  • (D) o(v*e)

A

Admin • 833.24K Points
Coach

Q. A person wants to visit some places. He starts from a vertex and then wants to visit every vertex till it finishes from one vertex, backtracks and then explore other vertex from same vertex. What algorithm he should use?

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

A

Admin • 833.24K Points
Coach

Q. Given an array of n elements and p processes, in the message-passing version of the parallel quicksort, each process stores ---------elements of array

  • (A) n*p
  • (B) n-p
  • (C) p/n
  • (D) n/p

A

Admin • 833.24K Points
Coach

Q. In parallel quick sort Pivot selecton strategy is crucial for

  • (A) maintaing load balance
  • (B) maintaining uniform distribution of elements in process groups
  • (C) effective pivot selection in next level
  • (D) all 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.