Top 50+ Solved Parallel Program Development MCQ Questions Answer
Q. Using _____________ we can systematically visit each node of the tree that could possibly lead to a least-cost solution.
a. depth-first search
b. Foster‘s methodology
c. reduced algorithm
d. breadth first search
Q. The newly created stack into our private stack, set the newstack variable to_____________.
a. Infinite
b. Zero
c. NULL
d. None of the above
Q. The ____________________ is a pointer to a block of memory allocated by theuser program and buffersize is its size in bytes.
a. tour data
b. node tasks
c. actual computation
d. buffer argument
Q. A _____________ function is called by Fulfillrequest.
a. descendants
b. Splitstack
c. dynamic mapping scheme
d. ancestors
Q. The cost of stack splitting in the MPI implementation is quite high; in addition to the cost of the communication, the packing and unpacking is very ________________.
a. global least cost
b. time- consuming
c. expensive tours
d. shared stack
Q. _____________ begins by checking on the number of tours that the processhas in its stack.
a. Terminated
b. Send rejects
c. Receive rejects
d. Empty
Q. The ____________ is the distributed-memory version of the OpenMP busywait loop.
a. For loop
b. while(1) loop
c. Do while loop
d. Empty
Q. ______________ sent to false and continue in the loop.
a. work_request
b. My_avail_tour_count
c. Fulfill_request
d. Split_stack packs
Q. ________________ takes the data in data to be packed and packs it intocontig_buf.
a. MPI Unpack
b. MPI_Pack
c. MPI_Datatype
d. MPI_Comm
Q. The _______________ function when executed by a process other than 0 sendsits energy to process 0.
a. Out of work
b. No_work_left
c. zero-length message
d. request for work