R4RIN – MCQs, Mock Tests | Cloud Computing High Performance Computing Set 4

What is TRUE about SHELL SORT

1. moves elements only one position at a time
2. moves elements long distance
3. during second phase algorithm switches to odd even transposition sort
4. both 2 and 3

✅ Correct Answer: 4

Which is the fastest sorting algorithm

1. bubble sort
2. odd-even transposition sort
3. shell sort
4. quick sort

✅ Correct Answer: 4

Pivot in Quick sort can be selected as

1. always first element
2. always last element
3. always middle index element
4. randomly selected element

✅ Correct Answer: 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

1. only one process is used
2. n processes are used
3. two processes are used
4. None of the above

✅ Correct Answer: 1

In Binary tree representation created by execution of Quick sort, Pivot is at C.

1. leaf node
2. root of tree
3. any internal node
4. None of the above

✅ Correct Answer: 2

What is the worst case time complexity of a quick sort algorithm?

1. o(n)
2. o(n log n
3. o(n2)
4. o(log n)

✅ Correct Answer: 3

What is the average running time of a quick sort algorithm?

1. o(n)
2. o(n log n)
3. o(n2)
4. o(log n)

✅ Correct Answer: 2

Odd-even transposition sort is a variation of

1. quick sort
2. shell sort
3. bubble sort
4. selection sort

✅ Correct Answer: 3

What is the average case time complexity of odd-even transposition sort?

1. o(n log n)
2. o(n)
3. o(log n)
4. o(n2)

✅ Correct Answer: 4

Shell sort is an improvement on

1. quick sort
2. bubble sort
3. insertion sort
4. selection sort

✅ Correct Answer: 3

In parallel Quick Sort Pivot is sent to processes by

1. broadcast
2. multicast
3. selective multicast
4. unicast

✅ Correct Answer: 1

In parallel Quick Sort each process divides the unsorted list into

1. n lists
2. 2 lists
3. 4 lists
4. n-1 lists

✅ Correct Answer: 2

Time Complexity of DFS is? (V â€“ number of vertices, E â€“ number of edges)

1. o(v + e)
2. o(v)
3. o(e)
4. o(v*e)

✅ Correct Answer: 1

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?

1. bfs
2. dfs
3. prims
4. kruskals

✅ Correct Answer: 2

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

1. n*p
2. n-p
3. p/n
4. n/p

✅ Correct Answer: 4

In parallel quick sort Pivot selecton strategy is crucial for

1. maintaing load balance
2. maintaining uniform distribution of elements in process groups
3. effective pivot selection in next level
4. All of the above

✅ Correct Answer: 4

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

1. first
2. scond
3. third
4. none of above

✅ Correct Answer: 3

Which Parallel formulation of Quick sort is possible

1. shared-address-space parallel formulation
2. message passing formulation
3. hypercube formulation
4. all of the above

✅ Correct Answer: 4

Which formulation of Dijkstra's algorithm exploits more parallelism

1. source-partitioned formulation
2. source-parallel formulation
3. partitioned-parallel formulation
4. All of the above

✅ Correct Answer: 2

The space required to store the adjacency matrix of a graph with n vertices is

1. in order of n
2. in order of n log n
3. in order of n squared
4. in order of n/2

✅ Correct Answer: 3

Graph can be represented by

1. identity matrix
2. adjacency matrix
3. sprse list
4. sparse matrix

✅ Correct Answer: 2

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

1. a) and c)
2. a) and b)
3. b) and c)
4. c) and d)

✅ Correct Answer: 2

A* algorithm is a

1. bfs algorithm
2. dfs algorithm
3. prims algorithm
4. kruskals algorithm

✅ Correct Answer: 1

identify Load-Balancing Scheme/s

1. asynchronous round robin
2. global round robin
3. random polling
4. all above methods

✅ Correct Answer: 4

important component of best-first search (BFS) algorithms is

1. open list
2. closed list
3. node list
4. mode list

✅ Correct Answer: 1

A CUDA program is comprised of two primary components: a host and a _____.

1. gpu kernel
2. cpu kernel
3. os
4. None of the above

✅ Correct Answer: 1

the BlockPerGrid and ThreadPerBlock parameters are related to the ________ model supported by CUDA.

1. host
2. kernel
3. thread abstraction
4. None of the above

✅ Correct Answer: 3

__ is Callable from the host

1. _host_
2. __global__
3. _device_
4. None of the above

✅ Correct Answer: 2

SIMD represents an organization that ______________.

1. refers to a computer system capable of processing several programs at the same time.
2. represents organization of single computer containing a control unit, processor unit and a memory unit.
3. includes many processing units under the supervision of a common control unit
4. None of the above

✅ Correct Answer: 3

Select different aspects of parallelism

1. server applications utilize high aggregate network bandwidth
2. scientific applications typically utilize high processing and memory system performance
3. all of the above
4. data intensive applications utilize high aggregate throughput

✅ Correct Answer: 4

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

1. 20
2. 40
3. 50
4. 10

✅ Correct Answer: 1

Analyze, if the second instruction has data dependencies with the first, but the third instruction does not, the first

1. out-of-order
2. in-order
3. both of the above
4. none of the above

✅ Correct Answer: 3

Select the parameters which captures Memory system performance

1. bandwidth
2. both of the above
3. none of the above
4. latency

✅ Correct Answer: 3

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.

1. bandwidth: 5*15 gallons/second and latency: 15 seconds
2. bandwidth: 15 gallons/second and latency: 5 seconds
3. . bandwidth: 3 gallons/second and latency: 5 seconds
4. bandwidth: 5 gallons/second and latency: 15 seconds

✅ Correct Answer: 3

Select alternate approaches for Hiding Memory Latency

1. multithreading
2. spatial locality
3. all of the above
4. prefeching

✅ Correct Answer: 4

Select which clause in OpenMP is similar to the private, except values of variables are initialized to corresponding values before the

1. firstprivate
2. shared
3. all of the above
4. private

✅ Correct Answer: 2

Which of the following projects of Blue Gene is not in development?

1. blue gene / m
2. blue gene / p
3. blue gene / q
4. . blue gene / l

✅ Correct Answer: 2

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

1. task dependency graph
2. task interaction graph
3. process interaction graph
4. process dependency graph

✅ Correct Answer: 2

In which case, the owner computes rule implies that the output is computed by the process to which the output data is assigned?

1. output data decomposition
2. input data decomposition
3. both (a) and (b)
4. none of the above

✅ Correct Answer: 3

Select relevant task characteristics from the options given below:

1. task sizes
2. size of data associated with tasks
3. task generation
4. All of the above

✅ Correct Answer: 4

A classic example of game playing - each 15 puzzle board is the example of

1. dynamic task generation
2. none of the above
3. all of the above
4. static task generation

✅ Correct Answer: 2

Which model is equally suitable to shared-address- space or message- passing paradigms, since the interaction is naturally two ways.

1. master slave model
2. data parallel model
3. producer consumer or pipeline model
4. work pool model

✅ Correct Answer: 2

In which type of the model, tasks are dynamically assigned to the processes for balancing the load?

1. master slave model
2. data parallel model
3. producer consumer or pipeline model
4. work pool model

✅ Correct Answer: 1

Select the appropriate stage of GPU Pipeline which receives commands from CPU and also pulls geometry information from system memory.

1. vertex processing
2. memory interface
3. host interface
4. pixel processing

✅ Correct Answer: 4

In all-to-one reduction, data items must be combined piece-wise and the result made available at a processor.

1. last
2. target
3. n-1
4. first

✅ Correct Answer: 3

Analyze the Cost of Scatter and Gather .

1. t=ts log p + tw m (p-1)
2. t=ts log p - tw m (p-1)
3. t=tw log p - ts m (p-1)
4. t=tw log p + ts m (p-1)

✅ Correct Answer: 2

All-to-all personalized communication is also known as

1. total exchange
2. both of the above
3. none of the above
4. partial exchange

✅ Correct Answer: 2

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

1. p
2. mâˆšp
3. pâˆšm
4. m

✅ Correct Answer: 3

In All-to-All Personalized Communication on a Ring, the size of the message reduces by at each step

1. p
2. m-1
3. p-1
4. m

✅ Correct Answer: 1

All-to-All Broadcast and Reduction algorithm on a Ring terminates in steps.

1. p+1
2. p-1
3. p*p
4. p

✅ Correct Answer: 3

MCQs Practice Portal - Help4study.com

Cloud Computing MCQ Quiz Hub

High Performance Computing Set 4