Cloud Computing MCQ Quiz Hub

1. What is TRUE about SHELL SORT
moves elements only one position at a time
moves elements long distance
during second phase algorithm switches to odd even transposition sort
both 2 and 3

2. Which is the fastest sorting algorithm
bubble sort
odd-even transposition sort
shell sort
quick sort

3. Pivot in Quick sort can be selected as
always first element
always last element
always middle index element
randomly selected element

4. In first step of parallelizing quick sort for n elements to get subarrays, which of the following statement is TRUE C. two processes are used
only one process is used
n processes are used
two processes are used
None of the above

5. In Binary tree representation created by execution of Quick sort, Pivot is at C.
leaf node
root of tree
any internal node
None of the above

6. What is the worst case time complexity of a quick sort algorithm?
o(n)
o(n log n
o(n2)
o(log n)

7. What is the average running time of a quick sort algorithm?
o(n)
o(n log n)
o(n2)
o(log n)

8. Odd-even transposition sort is a variation of
quick sort
shell sort
bubble sort
selection sort

9. What is the average case time complexity of odd-even transposition sort?
o(n log n)
o(n)
o(log n)
o(n2)

10. Shell sort is an improvement on
quick sort
bubble sort
insertion sort
selection sort

11. In parallel Quick Sort Pivot is sent to processes by
broadcast
multicast
selective multicast
unicast

12. In parallel Quick Sort each process divides the unsorted list into
n lists
2 lists
4 lists
n-1 lists

13. Time Complexity of DFS is? (V – number of vertices, E – number of edges)
o(v + e)
o(v)
o(e)
o(v*e)

14. A person wants to visit some places. He starts from a vertex and then wants to visit every vertex till it finishes from one vertex, backtracks and then explore other vertex from same vertex. What algorithm he should use?
bfs
dfs
prims
kruskals

15. Given an array of n elements and p processes, in the message-passing version of the parallel quicksort, each process stores ---------elements of array
n*p
n-p
p/n
n/p

16. In parallel quick sort Pivot selecton strategy is crucial for
maintaing load balance
maintaining uniform distribution of elements in process groups
effective pivot selection in next level
All of the above

17. In execution of the hypercube formulation of quicksort for d = 3, split along -----------dimention to partition sequence into two big blocks, one greater than pivot and other smaller than pivot as shown in diagram
first
scond
third
none of above

18. Which Parallel formulation of Quick sort is possible
shared-address-space parallel formulation
message passing formulation
hypercube formulation
all of the above

19. Which formulation of Dijkstra's algorithm exploits more parallelism
source-partitioned formulation
source-parallel formulation
partitioned-parallel formulation
All of the above

20. The space required to store the adjacency matrix of a graph with n vertices is
in order of n
in order of n log n
in order of n squared
in order of n/2

21. Graph can be represented by
identity matrix
adjacency matrix
sprse list
sparse matrix

22. to solve the all-pairs shortest paths problem which algorithm/s is/are used a) Floyd's algorithm b) Dijkstra's single-source shortest paths c) Prim's Algorithm d) Kruskal's Algorithm
a) and c)
a) and b)
b) and c)
c) and d)

23. A* algorithm is a
bfs algorithm
dfs algorithm
prims algorithm
kruskals algorithm

24. identify Load-Balancing Scheme/s
asynchronous round robin
global round robin
random polling
all above methods

25. important component of best-first search (BFS) algorithms is
open list
closed list
node list
mode list

26. A CUDA program is comprised of two primary components: a host and a _____.
gpu kernel
cpu kernel
os
None of the above

27. the BlockPerGrid and ThreadPerBlock parameters are related to the ________ model supported by CUDA.
host
kernel
thread abstraction
None of the above

28. __ is Callable from the host
_host_
__global__
_device_
None of the above

29. SIMD represents an organization that ______________.
refers to a computer system capable of processing several programs at the same time.
represents organization of single computer containing a control unit, processor unit and a memory unit.
includes many processing units under the supervision of a common control unit
None of the above

30. Select different aspects of parallelism
server applications utilize high aggregate network bandwidth
scientific applications typically utilize high processing and memory system performance
all of the above
data intensive applications utilize high aggregate throughput

31. Select correct answer: DRAM access times have only improved at the rate of roughly % per year over this interval.
20
40
50
10

32. Analyze, if the second instruction has data dependencies with the first, but the third instruction does not, the first
out-of-order
in-order
both of the above
none of the above

33. Select the parameters which captures Memory system performance
bandwidth
both of the above
none of the above
latency

34. Consider the example of a fire- hose. If the water comes out of the hose five seconds after the hydrant is turned on. Once the water starts flowing, if the hydrant delivers water at the rate of 15 gallons/second. Analyze the bandwidth and latency.
bandwidth: 5*15 gallons/second and latency: 15 seconds
bandwidth: 15 gallons/second and latency: 5 seconds
. bandwidth: 3 gallons/second and latency: 5 seconds
bandwidth: 5 gallons/second and latency: 15 seconds

35. Select alternate approaches for Hiding Memory Latency
multithreading
spatial locality
all of the above
prefeching

36. Select which clause in OpenMP is similar to the private, except values of variables are initialized to corresponding values before the
firstprivate
shared
all of the above
private

37. Which of the following projects of Blue Gene is not in development?
blue gene / m
blue gene / p
blue gene / q
. blue gene / l

38. A decomposition can be illustrated in the form of a directed graph with nodes corresponding to tasks and edges indicating that the result of one task is required for processing the next. Such graph is called as
task dependency graph
task interaction graph
process interaction graph
process dependency graph

39. In which case, the owner computes rule implies that the output is computed by the process to which the output data is assigned?
output data decomposition
input data decomposition
both (a) and (b)
none of the above

40. Select relevant task characteristics from the options given below:
task sizes
size of data associated with tasks
task generation
All of the above

41. A classic example of game playing - each 15 puzzle board is the example of
dynamic task generation
none of the above
all of the above
static task generation

42. Which model is equally suitable to shared-address- space or message- passing paradigms, since the interaction is naturally two ways.
master slave model
data parallel model
producer consumer or pipeline model
work pool model

43. In which type of the model, tasks are dynamically assigned to the processes for balancing the load?
master slave model
data parallel model
producer consumer or pipeline model
work pool model

44. Select the appropriate stage of GPU Pipeline which receives commands from CPU and also pulls geometry information from system memory.
vertex processing
memory interface
host interface
pixel processing

45. In all-to-one reduction, data items must be combined piece-wise and the result made available at a processor.
last
target
n-1
first

46. Analyze the Cost of Scatter and Gather .
t=ts log p + tw m (p-1)
t=ts log p - tw m (p-1)
t=tw log p - ts m (p-1)
t=tw log p + ts m (p-1)

47. All-to-all personalized communication is also known as
total exchange
both of the above
none of the above
partial exchange

48. All-to-all personalized communication is performed independently in each row with clustered messages of size on a mesh.
p
m√p
p√m
m

49. In All-to-All Personalized Communication on a Ring, the size of the message reduces by at each step
p
m-1
p-1
m

50. All-to-All Broadcast and Reduction algorithm on a Ring terminates in steps.
p+1
p-1
p*p
p