Top 50+ Solved Parallel Program Development MCQ Questions Answer

From 1 to 15 of 25

Q. The set of NP-complete problems is often denoted by ____________

a. NP-C

b. NP-C or NPC

c. NPC

d. None of the above

  • b. NP-C or NPC

Q. Pthreads has a nonblocking version of pthreads_mutex_lock called__________

a. pthread_mutex_lock

b. pthread_mutex_trylock

c. pthread_mutex_acquirelock

d. pthread_mutex_releaselock

  • b. pthread_mutex_trylock

Q. What are the algorithms for identifying which subtrees we assign to theprocesses or threads __________

a. breadth-first search

b. depth-first search

c. depth-first search breadth-first search

d. None of the above

  • c. depth-first search breadth-first search

Q. What are the scoping clauses in OpenMP _________

a. Shared Variables & Private Variables

b. Shared Variables

c. Private Variables

d. None of the above

  • a. Shared Variables & Private Variables

Q. The function My_avail_tour count can simply return the ________

a. Size of the process’ stack

b. Sub tree rooted at the partial tour

c. Cut-off length

d. None of the above

  • a. Size of the process’ stack

Q. MPI provides a function ________, for packing data into a buffer of contiguousmemory.

a. MPI_Pack

b. MPI_UnPack

c. MPI_Pack Count

d. MPI_Packed

  • a. MPI_Pack

Q. Two MPI_Irecv calls are made specifying different buffers and tags, but the same sender and request location. How can one determine that the buffer specified in the first call has valid data?

a. Call MPI_Probe

b. Call MPI_Testany with the same request listed twice

c. Call MPI_Wait twice with the same request

d. Look at the data in the buffer and try to determine whether it is

  • c. Call MPI_Wait twice with the same request

Q. Which of the following statements is not true?

a. MPI_lsend and MPI_Irecv are non-blocking message passing routines of MPI

b. MPI_lssend and MPI_Ibsend are non-blocking message passing routines of MPI

c. MPI_Send and MPI_Recv are non-blocking message passing routines of MPI

d. MPI_Ssend and MPI_Bsend are blocking message passing routines of MPI

  • a. MPI_lsend and MPI_Irecv are non-blocking message passing routines of MPI

Q. Which of the following is not valid with reference to Message PassingInterface (MPI)?

a. MPI can run on any hardware platform

b. The programming model is a distributed memory model

c. All parallelism is implicit

d. MPI - Comm - Size returns the total number of MPI processes in specified communication

  • c. All parallelism is implicit

Q. An _____________ is a program that finds the solution to an n-body problemby simulating the behavior of the particles.

a. Two N-Body Solvers

b. n-body solver

c. n-body problem

d. Newton‘s second law

  • b. n-body solver

Q. For the reduced n-body solver, a ________________ will best distribute theworkload in the computation of the forces.

a. cyclic distribution

b. velocity of each particle

c. universal gravitation

d. gravitational constant

  • a. cyclic distribution

Q. Parallelizing the two n-body solvers using _______________ is very similar toparallelizing them using OpenMP.

a. thread‘s rank

b. function Loopschedule

c. Pthreads

d. loop variable

  • c. Pthreads

Q. The run-times of the serial solvers differed from the single-process MPIsolvers by ______________.

a. More than 1%

b. less than 1%

c. Equal to 1%

d. Greater than 1%

  • b. less than 1%

Q. Each node of the tree has an_________________ , that is, the cost of the partialtour.

a. Euler‘s method

b. associated cost

c. three-dimensional problems

d. fast function

  • a. Euler‘s method
Subscribe Now

Get All Updates & News