High performance computing MCQ Unit-3 | HPC MCQ

High Performance Computing MCQ Questions and Answers UNIT – 3 What is High performance computing ? HPC – High Performance Computing is the use of parallel processing for running advanced application programs efficiently, reliably and quickly. The term applies especially to systems that function above a teraflop or 1012 floating-point operations per second. The term HPC is occasionally used as a synonym for supercomputing, although technically a supercomputer is a system that performs at or near the currently highest operational rate for computers. Some supercomputers work at more than a petaflop or 1015 floating-point operations per second.

High performance computing mcq sppu

High performance computing multiple choice questions UNIT -3

  1. The primary and essential mechanism to support the sparse matrices is

Gather-scatter operations
Gather operations
Scatter operations
Gather-scatter technique

Answer: Gather-scatter operations

  1. In the gather operation, a single node collects a ———

Unique message from each node
Unique message from only one node
Different message from each node
None of Above

Answer: Unique message from each node

  1. In the scatter operation, a single node sends a ————

Unique message of size m to every other node
Different message of size m to every other node
Different message of different size m to every other node
All of Above

Answer: Unique message of size m to every other node

  1. Is All to all Bradcasting is same as All to all personalized communication?

Yes
No

Answer: No

<img width=
  1. Is scatter operation is same as Broadcast?

Yes
No

Answer: No

  1. All-to-all personalized communication is also known as

Total Exchange
Personal Message
Scatter
Gather

Answer: Total Exchange

  1. By which way, scatter operation is different than broadcast

Message size
Number of nodes
Same
None of above

Answer: Message size

  1. The gather operation is exactly the _ of the scatter operation

Inverse
Reverse
Multiple
Same

Answer: Inverse

  1. The gather operation is exactly the inverse of the_

Scatter operation
Broadcast operation
Prefix Sum
Reduction operation

Answer: Scatter operation

hpc mcq questions

  1. The dual of one-to-all broadcast is all-to-one reduction. True or False?

TRUE
FALSE

Answer: TRUE

  1. A binary tree in which processors are (logically) at the leaves and internal nodes are routing nodes.

TRUE
FALSE

Answer: TRUE

  1. Group communication operations are built using point-to-point messaging primitives

TRUE
FALSE

Answer: TRUE

  1. Communicating a message of size m over an uncongested network takes time ts + tmw

True
False

Answer: True

  1. Parallel programs: Which speedup could be achieved according to Amdahl´s law for infinite number of processors if 5% of a program is sequential and the remaining part is ideally parallel?

Infinite speedup
5
20
None of above

Answer: 20

  1. Shift register that performs a circular shift is called

Invalid Counter
Valid Counter
Ring
Undefined

Answer: Ring

  1. 8 bit information can be stored in

2 Registers
4 Registers
6 Registers
8 Registers

Answer: 8 Registers

  1. The result of prefix expression * / b + – d a c d, where a = 3, b = 6, c = 1, d = 5 is

0
5
10
8

Answer: 10

  1. The height of a binary tree is the maximum number of edges in any root to leaf path. The maximum number of nodes in a binary tree of height h is?

2h – 1
2h – 1 – 1
2h + 1 – 1
2 * (h+1)

Answer: 2h + 1 – 1

  1. A hypercube has_

2^d nodes
2d nodes
2n Nodes
N Nodes

Answer: 2^d nodes

Parallel computing mcq with answers

  1. The Prefix Sum Operation can be implemented using the_

All-to-all broadcast kernel
All-to-one broadcast kernel
One-to-all broadcast Kernel
Scatter Kernel

Answer: All-to-all broadcast kernel

21.In the scatter operation_

Single node send a unique message of size m to every other node
Single node send a same message of size m to every other node
Single node send a unique message of size m to next node
None of Above

Answer: Single node send a unique message of size m to every other node

  1. In All-to-All Personalized Communication Each node has a distinct message of size m for every other node

True
False

Answer: True

  1. A binary tree in which processors are (logically) at the leaves and internal nodes are
    routing nodes.

True
False

Answer: True

  1. In All-to-All Broadcast each processor is thesource as well as destination.

True
False

Answer: True

Data analytics mcqs with answers for SPPU

Digital Image Processing MCQ | Basics Of Image Sampling & Quantization

Basic of Digital Image Processing

ALL unite digital Image Processing MCQ

HPC COMPLETE NOTES DOWNLOAD

HPC MCQ QUESTION AND ANSWER

HPC MCQ UNIT – 1

HPC MCQ UNIT -2

HPC MCQ UNIT – 4

HPC MCQ UNIT – 5

HPC MCQ UNIT – 6

READ MORE…

If you found this post useful, don’t forget to share this with your friends, and if you have any query feel free to comment it in the comment section.

Thank you 🙂 Keep Learning !

DeepCrazyWorld

Hey, I'm Deepika a professional blogger, web designer, Android developer and software engineer. I like to gain every type of knowledge that's why i have done many courses in different fields like engineering and technology. I love thrills and travelling to new places and hills.
5 1 vote
Article Rating
Subscribe
Notify of
guest
0 Comments
Inline Feedbacks
View all comments