Q. Deadlocks can be described by which graph?

View solution

Q. Choose the correct option regarding deadlock.

View solution

Q. Which of the following is deadlock avoidance algorithm?

View solution

Q.  In a graph the number of vertices of odd degree is always

View solution

Q. Consider a computer system with 6 tape drives and 'n' processes completing for them. What is the maximum value of 'n' for the system to be deadlock free? (Assuming that each processes may need 3 tape drives)

View solution

Q. A system has 'm' number of resources of same type and 3 processes A, B, C. Share these resources A, B, C which have the peak demand of 3, 4 and 6 respectively. Deadlock will not occur if the value of 'm' is __________.

View solution

Q. Which of the following statements is not valid for deadlock prevention scheme?

View solution

Q. Which of the following statements is not true for the deadlock prevention and deadlock avoidance schemes?

View solution

Q. In an undirected graph, the sum of degrees of all vertices is

View solution

Q. From the following statements which one is not a valid deadlock prevention scheme?

View solution

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