Data Analytics MCQs 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
2. 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
3. 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
4. Is All to all Bradcasting is same as All
to all personalized communication?
- Yes
- No
Answer
No
5. Is scatter operation is same as Broadcast?
- Yes
- No
Answer
No
6. All-to-all personalized communication is
also known as
- Total Exchange
- Personal Message
- Scatter
- Gather
Answer
Total
Exchange
7. By which way, scatter operation is
different than broadcast
- Message size
- Number of nodes
- Same
- None of above
Answer
Message
size
8. The gather operation is exactly the _ of
the scatter operation
- Inverse
- Reverse
- Multiple
- Same
Answer
Inverse
9. The gather operation is exactly the
inverse of the_
- Scatter operation
- Broadcast operation
- Prefix Sum
- Reduction operation
Answer
Scatter
operation
10. The dual of one-to-all broadcast is
all-to-one reduction. True or False?
- TRUE
- FALSE
Answer
TRUE
11. A binary tree in which processors are
(logically) at the leaves and internal nodes are routing nodes.
- TRUE
- FALSE
Answer
TRUE
12. Group communication operations are built
using point-to-point messaging primitives
- TRUE
- FALSE
Answer
TRUE
13. Communicating a message of size m over an
uncongested network takes time ts + tmw
- True
- False
Answer
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?
- Infinite speedup
- 5
- 20
- None of above
Answer
20
15. Shift register that performs a circular
shift is called
- Invalid Counter
- Valid Counter
- Ring
- Undefined
Answer
Ring
16. 8 bit information can be stored in
- 2 Registers
- 4 Registers
- 6 Registers
- 8 Registers
Answer
8
Registers
17. 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
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?
- 2h – 1
- 2h – 1 – 1
- 2h + 1 – 1
- 2 * (h+1)
Answer
2h
+ 1 – 1
19. A hypercube has_
- 2^d nodes
- 2d nodes
- 2n Nodes
- N Nodes
Answer
2^d
nodes
Parallel computing mcq with answers
20. 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
22. In All-to-All Personalized Communication
Each node has a distinct message of size m for every other node
- True
- False
Answer
True
23. A binary tree in which processors are
(logically) at the leaves and internal nodes are
routing nodes.
- True
- False
Answer
True
24. In All-to-All Broadcast each processor is
thesource as well as destination.
- True
- False
Answer
True
Comments
Post a Comment