Q.  What is known as a race condition?

View solution

Q. Which of the following approaches do not require knowledge of the system state?

View solution

Q. An operating system contains 3 user processes each requiring 2 units of resource R .The minimum number of units of R such that no deadlocks will ever arise is

View solution

Q. Before proceeding with its execution, each process must acquire all the resources it needs is called

View solution

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

View solution

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

View solution

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.

View solution

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

View solution

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

View solution

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

View solution

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

View solution

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

View solution

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?

View solution

Q. What is the reusable resource?

View solution

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

View solution

Q. A system is in the safe state if

View solution

Q. The circular wait condition can be prevented by

View solution

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

View solution

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

View solution

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

View solution