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.
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
What are the system components of an operating system and explain them? a) Process management b) Main-memory management c) I/O management d) File management e) Seco
Questiion 1 Use Priority Scheduling Algorithm to schedule the following processes Process Burst Time Priority/Time P1
This is a group project as described in the 'AssignmentDescription.pdf' file. I am doing a sub project which is "sub project Mobile application. Android or Apple based. Turn based
Define UFD and MFD. In the two-level directory structure, every user has her own user file directory (UFD). Every UFD has a similar structure, but lists only the files of a one
What are the allocation methods of a disk space? Methods of allocating disk space which are widely in use are a. Contiguous allocation b. Linked allocation c. Indexed
Q. Consider the demand-paged computer system where the level of multiprogramming is currently fixed at four. The system was recently deliberate to determine utilization of CPU and
ssssss
___paging fecthces a page only when needed
explain hierarchical,hashed and inverted paging
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