Top 250+ Solved High Performance Computing (HPC) MCQ Questions Answer

From 76 to 90 of 294

Q. Nvidia GPU based on following architecture

a. mimd

b. simd

c. sisd

d. misd

  • b. simd

Q. What is Critical Path?

a. the length of the longest path in a task dependency graph is called the critical path length.

b. the length of the smallest path in a task dependency graph is called the critical path length.

c. path with loop

d. none of the mentione

  • a. the length of the longest path in a task dependency graph is called the critical path length.

Q. Which decompositioin technique uses divide-andconquer strategy?

a. recursive decomposition

b. sdata decomposition

c. exploratory decomposition

d. speculative decomposition

  • a. recursive decomposition

Q. Consider Hypercube topology with 8 nodes then how many message passing cycles will require in all to all broadcast operation?

a. the longest path between any pair of finish nodes.

b. the longest directed path between any pair of start & finish node.

c. the shortest path between any pair of finish nodes.

d. the number of maximum nodes level in graph.

  • d. the number of maximum nodes level in graph.

Q. Scatter is ____________.

a. one to all broadcast communication

b. all to all broadcast communication

c. one to all personalised communication

d. node of the above.

  • c. one to all personalised communication

Q. Following issue(s) is/are the true about sorting techniques with parallel computing.

a. large sequence is the issue

b. where to store output sequence is the issue

c. small sequence is the issue

d. none of the above

  • b. where to store output sequence is the issue

Q. Partitioning on series done after ______________

a. local arrangement

b. processess assignments

c. global arrangement

d. none of the above

  • c. global arrangement

Q. Which are different sources of Overheads in Parallel Programs?

a. interprocess interactions

b. process idling

c. all mentioned options

d. excess computation

  • c. all mentioned options

Q. The ratio of the time taken to solve a problem on a parallel processors to the time required to solve the same problem on a single processor with p identical processing elements.

a. the ratio of the time taken to solve a problem on a single processor to the time required to solve the same problem on a parallel computer with p identical processing elements.

b. the ratio of the time taken to solve a problem on a single processor to the time required to solve the same problem on a parallel computer with p identical processing elements

c. the ratio of number of multiple processors to size of data

d. none of the above

  • b. the ratio of the time taken to solve a problem on a single processor to the time required to solve the same problem on a parallel computer with p identical processing elements

Q. CUDA helps do execute code in parallel mode using __________

a. cpu

b. gpu

c. rom

d. cash memory

  • b. gpu

Q. In thread-function execution scenario thread is a ___________

a. work

b. worker

c. task

d. none of the above

  • b. worker

Q. In GPU Following statements are true

a. grid contains block

b. block contains threads

c. all the mentioned options.

d. sm stands for streaming multiprocessor

  • c. all the mentioned options.
Subscribe Now

Get All Updates & News