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

Q. Deadlock prevention strategies are very

View solution

Q. A consumable resource is one that can be

View solution

Q. A signal is a software mechanism that informs a

View solution

Q. No preemption means that a resource is released as

View solution

Q. Deadlock avoidance requires knowledge of future

View solution

Q. The circular wait condition can be prevented by defining a linear ordering of

View solution

Q. An unsafe state is of course a state that is not

View solution

Q. Linux includes all of the concurrency mechanism found in other

View solution

Q. The dining philosophers problem can be seen as representative of

View solution

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

View solution

Q. To solve the dining philosophers, the monitor consist of two

View solution

Q. The conditions for deadlock, only one process may use a resource at a

View solution

Q. A useful tool in characterizing and allocating of resources to process is the

View solution