# High performance computing mcq sppu Unit 3

## High performance computing multiple choice questions

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

1. Gather-scatter operations
2. Gather operations
3. Scatter operations
4. Gather-scatter technique

Gather-scatter operations

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

1. Unique message from each node
2. Unique message from only one node
3. Different message from each node
4. None of Above

Unique message from each node

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

1. Unique message of size m to every other node
2. Different message of size m to every other node
3. Different message of different size m to every other node
4. All of Above

Unique message of size m to every other node

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

1. Yes
2. No

No

5. Is scatter operation is same as Broadcast?

1. Yes
2. No

No

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

1. Total Exchange
2. Personal Message
3. Scatter
4. Gather

Total Exchange

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

1. Message size
2. Number of nodes
3. Same
4. None of above

Message size

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

1. Inverse
2. Reverse
3. Multiple
4. Same

Inverse

9. The gather operation is exactly the inverse of the_

1. Scatter operation
3. Prefix Sum
4. Reduction operation

Scatter operation

## hpc mcq questions

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

1. TRUE
2. FALSE

TRUE

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

1. TRUE
2. FALSE

TRUE

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

1. TRUE
2. FALSE

TRUE

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

1. True
2. False

True

14. 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?

1. Infinite speedup
2. 5
3. 20
4. None of above

20

15. Shift register that performs a circular shift is called

1. Invalid Counter
2. Valid Counter
3. Ring
4. Undefined

Ring

16. 8 bit information can be stored in

1. 2 Registers
2. 4 Registers
3. 6 Registers
4. 8 Registers

8 Registers

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

1. 0
2. 5
3. 10
4. 8

10

18. 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?

1. 2h â€“ 1
2. 2h â€“ 1 â€“ 1
3. 2h + 1 â€“ 1
4. 2 * (h+1)

2h + 1 â€“ 1

19. A hypercube has_

1. 2^d nodes
2. 2d nodes
3. 2n Nodes
4. N Nodes

2^d nodes

## Parallel computing mcq with answers

20. The Prefix Sum Operation can be implemented using the_

4. Scatter Kernel

21.In the scatter operation_

1. Single node send a unique message of size m to every other node
2. Single node send a same message of size m to every other node
3. Single node send a unique message of size m to next node
4. None of Above

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

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

1. True
2. False

True

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

1. True
2. False

True

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

1. True
2. False