Q. A deadlock eventually cripples system throughput and will cause the CPU utilization to ______

View solution

Q. Every time a request for allocation cannot be granted immediately, the detection algorithm is invoked. This will help identify :

View solution

Q. A computer system has 6 tape drives, with ‘n’ processes competing for them. Each process may need 3 tape drives. The maximum value of ‘n’ for which the system is guaranteed to be deadlock free is :

View solution

Q. A system has 3 processes sharing 4 resources. If each process needs a maximum of 2 units then, deadlock :

View solution

Q. ‘m’ processes share ‘n’ resources of the same type. The maximum need of each process doesn’t exceed ‘n’ and the sum of all their maximum needs is always less than m+n. In this setup, deadlock :

View solution

Q. A deadlock can be broken by :

View solution

Q. The two ways of aborting processes and eliminating deadlocks are :

View solution

Q. Those processes should be aborted on occurrence of a deadlock, the termination of which :

View solution

Q. The process to be aborted is chosen on the basis of the following factors :

View solution

Q. Cost factors of process termination include :

View solution

Q. If we preempt a resource from a process, the process cannot continue with its normal execution and it must be :

View solution

Q. To _______ to a safe state, the system needs to keep more information about the states of processes.

View solution

Q. If the resources are always preempted from the same process, __________ can occur.

View solution

Q. The solution to starvation is :

View solution

Q. A system has 12 magnetic tape drives and 3 processes : P0, P1, and P2. Process P0 requires 10 tape drives, P1 requires 4 and P2 requires 9 tape drives.

Process
P0
P1
P2

Maximum needs (process-wise : P0 through P2 top to bottom)
10
4
9

Currently allocated (process-wise)
5
2
2


Which of the following sequence is a safe sequence ?

View solution

Q. What problem is solved by Dijkstra's banker's algorithm?

View solution

Q. Four necessary conditions for deadlock to exist are: mutual exclusion, no-preemption, circular wait and

View solution

Q. Banker's algorithm for resource allocation deals with

View solution

Q. All deadlocks involve conflicting needs for

View solution

Q. The fastest form of inter process communication provided in UNIX is

View solution