adplus-dvertising
frame-decoration

Question

To avoid race condition, the maximum number of processes that may be simultaneously inside the critical section is

a.

zero

b.

one

c.

two

d.

more than two

Posted under Operating System

Answer: (b).one

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. To avoid race condition, the maximum number of processes that may be simultaneously inside the critical section is

Similar Questions

Discover Related MCQs

Q. Which of the following is not the approach to dealing with deadlock ?

Q. Match the following.

i) Mutual exclusion a) A process may hold allocated resources while waiting assignment.
ii) Hold and wait b) No resource can be forcibly removed from a process holding it.
iii) No preemption c) Only one process may use a resource at a time.

Q. A direct method of deadlock prevention is to prevent the occurrences of ...................

Q. ……………. can be defined as the permanent blocking of a set of processed that either complete for system resources or communicate with each other.

Q. The following conditions of policy must be present for a deadlock to be possible.

i) Mutual exclusion ii) Hold and wait
iii) No preemption iv) Circular wait

Q. A direct method of deadlock prevention is to prevent the occurrence of …………..

Q. The simplest way of remove deadlock from the system is to ...

Q. In the multiprogramming system, a set of processes is deadlock if each process in the set is waiting for an event to occur that can be initialized only by another process in the set. Which of the following is not one of the four conditions that are necessary for deadlock to occur?

Q. What is the reusable resource?

Q. Which of the following condition is required for deadlock to be possible?

Q. A system is in the safe state if

Q. The circular wait condition can be prevented by

Q. Which one of the following is the deadlock avoidance algorithm?

Q. What is the drawback of banker’s algorithm?

Q. For effective operating system, when to check for deadlock?

Q. A problem encountered in multitasking when a process is perpetually denied necessary resources is called

Q. Which one of the following is a visual ( mathematical ) way to determine the deadlock occurrence?

Q. To avoid deadlock

Q. The number of resources requested by a process :

Q. The request and release of resources are ___________