Operating-systems Questions Set 49:
Which of the following is not contained in a Process Control Block (PCB)?
Solution:
RPC provides a stub on the client-side, a separate one for each remote procedure.
Solution:
Which of the following queues are not maintained by the operating system for processes?
Solution:
In segmentation, each address is specified by a segment number and offset
Solution:
What is the ready state of a process?
Solution:
"when a low priority program is requesting for a system resource but is not able to execute because a higher priority program is utilizing that resource for an extended period"
What phenomenon does the above statement represent?
Solution:
The strategy of making running processes that are logically runnable to be temporarily suspended is called?
Solution:
What is a stub in distributed computing?
Solution:
Consider a computer system with multiple shared resource types, with one instance per resource type. Each instance can owned by only one process at a time. Owning and freeing of resources are done by holding a global lock (L). The following scheme is used to own a resource instance:
function OwnResource (Resource R) Acquire lock L // a global lock if R is available then Acquire R Release lock L else if R is owned by another process P then Terminate P, after releasing all resources owned by P Acquire R Restart P Release lock L end if end if end function
Which of the following is/are true about the above scheme?
- The scheme violates the mutual exclusion property
- The scheme ensures the deadlocks will not occur
- The scheme may lead to live-lock
- The scheme may lead to starvation
Solution:
Consider the following policies for preventing deadlock in a system with mutually exclusive resources.
I. Processes should acquire all their resources at the beginning of execution. If any resource is not available, all resources acquired so far are released. II. The resources are numbered uniquely, and processes are allowed to request for resources only in increasing resource numbers. III. The resources are numbered uniquely, and processes are allowed to request for resources only in decreasing resource numbers. IV. The resources are numbered uniquely. A process is allowed to request only for a resource with resource number larger than its currently held resources.
Which of the above policies can be used for preventing deadlock?
Solution:
Related Question Sets:
Related Topics:
Scroll to Top
