Home / Engineering / High Performance Computing MCQs / Page 5

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.

M

Mr. Dubey • 51.17K Points
Coach

Q. 41) Breadth First Search is equivalent to which of the traversal in the Binary Trees?

(A) pre-order traversal
(B) post-order traversal
(C) level-order traversal
(D) in-order traversal
View Answer Discuss Share

M

Mr. Dubey • 51.17K Points
Coach

Q. 42) 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)
View Answer Discuss Share

M

Mr. Dubey • 51.17K Points
Coach

Q. 43) 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
View Answer Discuss Share

M

Mr. Dubey • 51.17K Points
Coach

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

(A) once
(B) twice
(C) equivalent to number of indegree of the node
(D) thrice
View Answer Discuss Share

M

Mr. Dubey • 51.17K Points
Coach

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

(A) true
(B) false
(C) ---
(D) ---
View Answer Discuss Share

M

Mr. Dubey • 51.17K Points
Coach

Q. 46) 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
View Answer Discuss Share

M

Mr. Dubey • 51.17K Points
Coach

Q. 47) 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.
View Answer Discuss Share

M

Mr. Dubey • 51.17K Points
Coach

Q. 48) mathematically efficiency is

(A) e=s/p
(B) e=p/s
(C) e*s=p/2
(D) e=p+e/e
View Answer Discuss Share

M

Mr. Dubey • 51.17K Points
Coach

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

(A) work
(B) processor time
(C) both
(D) none
View Answer Discuss Share

M

Mr. Dubey • 51.17K Points
Coach

Q. 50) 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
View Answer Discuss Share

Explore Sets

High Performance Computing MCQs Set 1

High Performance Computing MCQs Set 2

High Performance Computing MCQs Set 3

High Performance Computing MCQs Set 4

High Performance Computing MCQs Set 5

High Performance Computing MCQs Set 6

High Performance Computing MCQs Set 7

High Performance Computing MCQs Set 8

High Performance Computing MCQs Set 9

High Performance Computing MCQs Set 10

High Performance Computing MCQs Set 11

High Performance Computing MCQs Set 12

High Performance Computing MCQs Set 13

High Performance Computing MCQs Set 14

High Performance Computing MCQs Set 15

High Performance Computing MCQs Set 16

High Performance Computing MCQs Set 17

High Performance Computing MCQs Set 18

High Performance Computing MCQs Set 19

High Performance Computing MCQs Set 20

High Performance Computing MCQs Set 21

High Performance Computing MCQs Set 22

High Performance Computing MCQs Set 23

High Performance Computing MCQs Set 24

High Performance Computing MCQs Set 25

High Performance Computing MCQs Set 26

High Performance Computing MCQs Set 27

High Performance Computing MCQs Set 28

High Performance Computing MCQs Set 29

High Performance Computing MCQs Set 30

High Performance Computing MCQs Set 31

High Performance Computing MCQs Set 32

High Performance Computing MCQs Set 33

High Performance Computing MCQs Set 34

High Performance Computing MCQs Set 35

High Performance Computing MCQs Set 36

High Performance Computing MCQs Set 37

High Performance Computing MCQs Set 38

High Performance Computing MCQs Set 39

High Performance Computing MCQs Set 40

High Performance Computing MCQs Set 41

High Performance Computing MCQs Set 42

High Performance Computing MCQs Set 43