Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
A system consists of 10 units of resource class Ru. The resource needs of three user processes P1, P2 and P3 are like this
Using Banker's algorithm, define if the projected allocation state is safe and if the request of P1 will be granted or not.
Ans: From the given data:
Total_alloc=[7]
Total_exist=[10]
The projected allocation state is feasible because the total allocation in it does not exceed the number of resource units of Ru. As P3 is two units short of its maximum needs and two unallocated units exits in the system, therefore P3 can complete. This will release the resources allocated to it, that is, 5 resources. Here now P1 can complete since the number of unallocated units of Ru exceeds the units required to satisfy its maximum need then P2 can be completed. So the processes can finish in the sequence P3, P1, and P2. Therefore projected allocation state is safe so algorithm will grant the request that is made by P1.
How can an index file be used to speed up the access in direct-access files? Have an index in memory; the index gives the key and the disk location of its corresponding record.
Q. What protection problems may occur if a shared stack is used for parameter passing? Answer: The contents of the stack could be conciliation by other process(es) sharing th
Dynamic scheduling : The number of thread in a program may be changed during the course of operation. Dynamic priority scheduling is a kind of scheduling algorithm in which the pr
What is banker's algorithm? Banker's algorithm is a deadlock avoidance algorithm that is applicable to a resource-allocation system with multiple examples of each resource type
The drawbacks of fixed partitioning are: The number of partitions are précised at system generation time limits the number of active processes in the system. For the re
what is dual mode operation
Placement algorithms :calculate where in available real-memory to execute a program. Common functions are next-fit, first-fit, and best-fit. Replacement algorithms :are
The CTO is still impressed with your work. He just came back from a technology exposition where he heard about computer clusters. All he knows is that they are the big thing for bu
What are overlays? To enable a process to be larger than the amount of memory allocated to it, overlays are used. The idea of overlays is to keep in memory only those instructi
What are the characteristics of SRS? i. Correct - The SRS should be made up to date when appropriate requirements are identified. ii. Unambiguous - When the requirements are
Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!
whatsapp: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd