## High performance computing MCQ Unit-4 | HPC MCQ

High Performance Computing MCQ Questions and Answers UNIT – 4 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 UNIT – 4

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

1. Cost of a parallel system is sometimes referred to____ of product

work
processor time
both
none

1. Scaling Characteristics of Parallel Programs Ts is

increase
constant
decreases
none

1. Speedup tends to saturate and efficiency _ as a consequence of Amdahl’s law.

increase
constant
decreases
none

1. Speedup obtained when the problem size is __ linearly with the number of processing elements.

increase
constant
decreases
depend on problem size

1. The n × n matrix is partitioned among n processors, with each processor storing complete _ _ of the matrix.

row
column
both
depend on processor

1. cost-optimal parallel systems have an efficiency of _

1
n
logn
complex

1. The n × n matrix is partitioned among n2 processors such that each processor owns a _ element

n
2n
single
double

1. how many basic communication operations are used in matrix vector multiplication

1
2
3
4

1. In DNS algorithm of matrix multiplication it used

1d partition
2d partition
3d partition
both a,b

high performance computing mcq sppu

1. In the Pipelined Execution, steps contain

normalization
communication
elimination
all

1. 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

1. The load imbalance problem in Parallel Gaussian Elimination: can be alleviated by using a __

mapping
acyclic
cyclic
both
none

1. A parallel algorithm is evaluated by its runtime in function of

the input size,
the number of processors,
the communication parameters.
all

1. For a problem consisting of W units of work, p__W processors can be used optimally

a)<=

b)>=
c)<

d)>

1. C(W)__Θ(W) for optimality (necessary condition).

>
<
<=
equals

1. many interactions in oractical parallel programs occur in __ pattern

well defined
zig-zac
reverse
straight

1. efficient implementation of basic communication operation can improve

performance
communication
algorithm
all

1. efficient use of basic communication operations can reduce

development effort
software quality
both
none

high performance computing mcq questions

1. Group communication operations are built using _ Messenging primitives.

point-to-point
one-to-all
all-to-one
none

1. 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

1. wimpleat way to send p-1 messages from source to the other p-1 processors

Algorithm
communication
concurrency

1. In a eight node ring, node __ is source of broadcast

1
2
8
0

1. The processors compute __ product of the vector element and the local matrix

local
global
both
none

1. one to all broadcast use

recursive doubling
simple algorithm
both
none

1. In a broadcast and reduction on a balanced binary tree reduction is done in __

recursive order
straight order
vertical order
parallel order

1. if “X” is the message to broadcast it initially resides at the source node

1
2
8
0

1. logical operators used in algorithm are

XOR
AND
both
none

1. Generalization of broadcast in Which each processor is

Source as well as destination
only source
only destination
none

Answer: Source as well as destination

1. The algorithm terminates in _ steps

p
p+1
p+2
p-1

1. Each node first sends to one of its neighbours the data it need to….

identify
verify
none

1. The second communication phase is a columnwise __ broadcast of consolidated

All-to-all
one -to-all
all-to-one
point-to-point

1. All nodes collects _ message corresponding to √p nodes to their respectively

√p
p
p+1
p-1

1. It is not possible to port __ for higher dimensional network

Algorithm
hypercube
both
none

1. If we port algorithm to higher dimemsional network it would cause

error
contention
recursion
none

1. In the scatter operation __ node send message to every other node

single
double
triple
none

1. The gather Operation is exactly the inverse of _

scatter operation
recursion operation
execution
none

1. Similar communication pattern to all-to-all broadcast except in the_____

reverse order
parallel order
straight order
vertical order

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