high performance computing mcq questions and answers
1. mathematically efficiency is
- e=s/p
- e=p/s
- e*s=p/2
- e=p+e/e
e=s/p
2. Cost of a parallel system is sometimes referred to____ of product
- work
- processor time
- both
- none
both
3. Scaling Characteristics of Parallel Programs Ts is
- increase
- constant
- decreases
- none
constant
4. Speedup tends to saturate and efficiency _ as a consequence of Amdahl’s law.
- increase
- constant
- decreases
- none
decreases
5. Speedup obtained when the problem size is ______ linearly with the number of processing elements.
- increase
- constant
- decreases
- depend on problem size
increase
6. The n × n matrix is partitioned among n processors, with each processor storing complete ___ _ of the matrix.
- row
- column
- both
- depend on processor
row
7. cost-optimal parallel systems have an efficiency of _____
- 1
- n
- logn
- complex
1
8. The n × n matrix is partitioned among n2 processors such that each processor owns a _ element
- n
- 2n
- single
- double
single
9. how many basic communication operations are used in matrix vector multiplication
- 1
- 2
- 3
- 4
3
10. In DNS algorithm of matrix multiplication it used
- 1d partition
- 2d partition
- 3d partition
- both a,b
3d partition
high performance computing mcq sppu
11. In the Pipelined Execution, steps contain
- normalization
- communication
- elimination
- all
all
12. the cost of the parallel algorithm is higher than the sequential run time by a factor of __
- 3/2
- 2/3
- 3*2
- 2/3+3/2
3/2
13. The load imbalance problem in Parallel Gaussian Elimination: can be alleviated by using a __
- mapping
- acyclic
- cyclic
- both
- none
acyclic
14. A parallel algorithm is evaluated by its runtime in function of
- the input size,
- the number of processors,
- the communication parameters.
- all
all
15. For a problem consisting of W units of work, p__W processors can be used optimally
- <=
- >=
- <
- >
<=
16. C(W)__Θ(W) for optimality (necessary condition).
- >
- <
- <=
- equals
equals
17. many interactions in oractical parallel programs occur in ____ pattern
- well defined
- zig-zac
- reverse
- straight
well defined
18. efficient implementation of basic communication operation can improve
- performance
- communication
- algorithm
- all
performance
19. efficient use of basic communication operations can reduce
- development effort
- software quality
- both
- none
development effort
high performance computing mcq questions
20. Group communication operations are built using _____ Messenging primitives.
- point-to-point
- one-to-all
- all-to-one
- none
point-to-point
21. one processor has a piece of data and it need to send to everyone is
- one -to-all
- all-to-one
- point -to-point
- all of above
one -to-all
22. wimpleat way to send p-1 messages from source to the other p-1 processors
- Algorithm
- communication
- concurrency
- receiver
concurrency
23. In a eight node ring, node __ is source of broadcast
- 1
- 2
- 8
- 0
0
24. The processors compute __ product of the vector element and the local matrix
- local
- global
- both
- none
local
25. one to all broadcast use
- recursive doubling
- simple algorithm
- both
- none
recursive doubling
26. In a broadcast and reduction on a balanced binary tree reduction is done in __
- recursive order
- straight order
- vertical order
- parallel order
recursive order
27. if “X” is the message to broadcast it initially resides at the source node
- 1
- 2
- 8
- 0
0
28. logical operators used in algorithm are
- XOR
- AND
- both
- none
both
29. Generalization of broadcast in Which each processor is
- Source as well as destination
- only source
- only destination
- none
Source as well as destination
30. The algorithm terminates in _ steps
- p
- p+1
- p+2
- p-1
p-1
30. Each node first sends to one of its neighbours the data it need to….
- broadcast
- identify
- verify
- none
broadcast
30. The second communication phase is a columnwise __ broadcast of consolidated
- All-to-all
- one -to-all
- all-to-one
- point-to-point
All-to-all
30. All nodes collects _ message corresponding to √p nodes to their respectively
- √p
- p
- p+1
- p-1
√p
30. It is not possible to port __ for higher dimensional network
- Algorithm
- hypercube
- both
- none
Algorithm
30. If we port algorithm to higher dimemsional network it would cause
- error
- contention
- recursion
- none
contention
30. In the scatter operation __ node send message to every other node
- single
- double
- triple
- none
single
30. The gather Operation is exactly the inverse of _
- scatter operation
- recursion operation
- execution
- none
scatter operation
30. Similar communication pattern to all-to-all broadcast except in the_____
- reverse order
- parallel order
- straight order
- vertical order
reverse order
Data Analytics sppu mcq
high performance computing mcq, high performance computing mcq sppu, high performance computing mcq questions, high performance computing multiple choice questions, high performance computing mcq questions and answers, sppu question bank mcq pdf, sppu question bank mcq for engineering, high performance computing quiz, hpc mcq questions, parallel computing mcq with answers