Top 50+ Solved Parallel Program Challenges MCQ Questions Answer
Q. Producer consumer problem can be solved using _____________
a. semaphores
b. event counters
c. monitors
d. All of the above
Q. The segment of code in which the process may change common variables, update tables, write into files is known as :
a. program
b. critical section
c. non – critical section
d. synchronizing
Q. All deadlocks involve conflicting needs for __________
a. Resources
b. Users
c. Computers
d. Programs
Q. ___________ are used for signaling among processes and can be readily usedto enforce a mutual exclusion discipline.
a. Semaphores
b. Messages
c. Monitors
d. Addressing
Q. To avoid deadlock ____________
a. there must be a fixed number of resources to allocate
b. resource allocation must be done only once
c. all deadlocked processes must be aborted
d. inversion technique can be used
Q. A minimum of _____ variable(s) is/are required to be shared betweenprocesses to solve the critical section problem.
a. one
b. two
c. three
d. four
Q. Spinlocks are intended to provide __________ only.
a. Mutual Exclusion
b. Bounded Waiting
c. Aging
d. Progress
Q. To ensure difficulties do not arise in the readers – writer’s problem, _______are given exclusive access to the shared object.
a. readers
b. writers
c. readers and writers
d. none of the above
Q. If a process is executing in its critical section, then no other processes canbe executing in their critical section. This condition is called ___________.
a. Out-of-order execution
b. Hardware prefetching
c. Software prefetching
d. mutual exclusion
Q. A semaphore is a shared integer variable ____________.
a. lightweight process
b. that cannot drop below zero
c. program counter
d. stack space
Q. A critical section is a program segment ______________.
a. where shared resources are accessed
b. single thread of execution
c. improves concurrency in multi-core system
d. Lower resource consumption
Q. A system has 3 processes sharing 4 resources. If each process needs amaximum of 2 units, then _____________
a. Better system utilization
b. deadlock can never occur
c. Responsiveness
d. Faster execution
Q. _____________ refers to the ability of multiple process (or threads) to share code, resources or data in such a way that only one process has access to shared object at a time.
a. Readers_writer locks
b. Barriers
c. Semaphores
d. Mutual Exclusion
Q. ____________ is the ability of multiple processes to co-ordinate their activitiesby exchange of information.
a. Deadlock
b. Synchronization
c. Mutual Exclusion
d. Cache