High Performance Computing MCQs with answers Page - 5

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

Q. Time Complexity of Breadth First Search 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 • 831.35K Points
Coach

Q. Which of the following is not an application of Breadth First Search?

  • (A) when the graph is a binary tree
  • (B) when the graph is a linked list
  • (C) when the graph is a n-ary tree
  • (D) when the graph is a ternary tree

A

Admin • 831.35K Points
Coach

Q. In BFS, how many times a node is visited?

  • (A) once
  • (B) twice
  • (C) equivalent to number of indegree of the node
  • (D) thrice

A

Admin • 831.35K Points
Coach

Q. Is Best First Search a searching algorithm used in graphs.

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

A

Admin • 831.35K Points
Coach

Q. Which of the following is not a stable sorting algorithm in its typical implementation.

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

A

Admin • 831.35K Points
Coach

Q. Which of the following is not true about comparison based sorting algorithms?

  • (A) the minimum possible time complexity of a comparison based sorting algorithm is o(nlogn) for a random input array
  • (B) any comparison based sorting algorithm can be made stable by using position as a criteria when two elements are compared
  • (C) counting sort is not a comparison based sorting algortihm
  • (D) heap sort is not a comparison based sorting algorithm.

A

Admin • 831.35K Points
Coach

Q. mathematically efficiency is

  • (A) e=s/p
  • (B) e=p/s
  • (C) e*s=p/2
  • (D) e=p+e/e

A

Admin • 831.35K Points
Coach

Q. Cost of a parallel system is sometimes referred to____ of product

  • (A) work
  • (B) processor time
  • (C) both
  • (D) none

A

Admin • 831.35K Points
Coach

Q. In a broadcast and reduction on a balanced binary tree reduction is done in ______

  • (A) recursive order
  • (B) straight order
  • (C) vertical order
  • (D) parallel order

A

Admin • 831.35K Points
Coach

Q. if "X" is the message to broadcast it initially resides at the source node

  • (A) 1
  • (B) 2
  • (C) 8
  • (D) 0

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.