High Performance Computing MCQs | Page - 44

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.

A

Admin • 36.96K Points
Coach

Q. to solve the all-pairs shortest paths problem which algorithm's is/are used
a) Floyd's algorithm
b) Dijkstra's single-source shortest paths
c) Prim's Algorithm
d) Kruskal's Algorithm

(A) a) and c)
(B) a) and b)
(C) b) and c)
(D) c) and d)
View Answer Discuss Share

V

Vinay • 28.75K Points
Instructor II

Q. M.J. Flynn's parallel processing classification is based on:

(A) multiple instructions
(B) multiple data
(C) both (a) and (b)
(D) none of the above
View Answer Discuss Share

V

Vinay • 28.75K Points
Instructor II

Q. In sorting networks for INCREASING COMPARATOR with input x,y select the correct output X', Y' from the following options

(A) x\ = min { x , y } and y\ = min { x , y }
(B) x\ = max { x , y } and y\ = min { x , y }
(C) x\ = min { x , y } and y\ = max{ x , y }
(D) x\ = max { x , y } and y\ = max { x , y }
View Answer Discuss Share

R

Ram Sharma • 193.86K Points
Coach

Q. In sorting networks for DECREASING COMPARATOR with input x,y select the correct output X', Y' from the following options

(A) x\ = min { x , y } and y\ = min { x , y }
(B) x\ = max { x , y } and y\ = min { x , y }
(C) x\ = min { x , y } and y\ = max{ x , y }
(D) x\ = max { x , y } and y\ = max { x , y }
View Answer Discuss Share

R

Ram Sharma • 193.86K Points
Coach

Q. Quicksort's performance is greatly affected by the way it partitions a sequence.

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

V

Vijay Sangwan • 28.62K Points
Instructor II

Q. CUDA thought that 'unifying theme' of every form of parallelism is

(A) cda thread
(B) pta thread
(C) cuda thread
(D) cud thread
View Answer Discuss Share

G

Gopal Sharma • 38.32K Points
Coach

Q. In ___________, the number of elements to be sorted is small enough to fit into the process's main memory.

(A) internal sorting
(B) internal searching
(C) external sorting
(D) external searching
View Answer Discuss Share

Jump to

Download our easy to use, user friendly Android App from Play Store. And learn MCQs with one click.

Image