Q. Breadth First Search is equivalent to which of the traversal in the Binary Trees?
✅ Correct Answer: (C)
level-order traversal
High Performance Computing MCQs | Page - 5
Dear candidates you will find MCQ questions of High Performance Computing here. Learn these questions and prepare yourself for coming examinations and interviews. You can check the right answer of any question by clicking on any option or by clicking view answer button.
Q. Time Complexity of Breadth First Search is? (V – number of vertices, E – number of edges)
✅ Correct Answer: (A)
o(v + e)
Q. Which of the following is not an application of Breadth First Search?
✅ Correct Answer: (B)
when the graph is a linked list
Q. In BFS, how many times a node is visited?
✅ Correct Answer: (C)
equivalent to number of indegree of the node
Q. Is Best First Search a searching algorithm used in graphs.
✅ Correct Answer: (A)
true
Q. Which of the following is not a stable sorting algorithm in its typical implementation.
✅ Correct Answer: (C)
quick sort
Q. Which of the following is not true about comparison based sorting algorithms?
✅ Correct Answer: (D)
heap sort is not a comparison based sorting algorithm.
Q. Cost of a parallel system is sometimes referred to____ of product
✅ Correct Answer: (C)
both
Q. In a broadcast and reduction on a balanced binary tree reduction is done in ______
✅ Correct Answer: (A)
recursive order
Jump to