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.
operation policies
Sir i want formulas in Memory management starting from paging till the demang paging in a easy manner for solving problems in competitive exams
Q. Consider the two-dimensional array A: int A[][] = new int[100][100]; Whereas A [0][0] is at location 200 in a paged memory system with pages of size 200. A little process
Describe paging technique used in UNIX systems. When a process begin in UNIX, not every its memory pages are read in from the disk at once. In its place, the kernel loads into
What is a resource-allocation graph? Deadlocks can be explained more precisely in terms of a directed graph called a system resource allocation graph. This graph having of a se
what is secondary storage management
advantages and disadvantages of monolithic and layered approach
Explain Rehashing to Handle Collision Rehashing: Re-hashing schemes make use of a second hashing operation while there is a collision. If there is an additional collision, we
List out the advantages of windows 2000 file management. Permits detailed security for individual folders and files. Built-in granular compression capabilities
Additional-reference-bits algorithm We can keep an 8-bit byte for every page in a table in memory. The operating system shifts the reference bits right 1 bit, discarding the lo
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: +1-415-670-9521
Phone: +1-415-670-9521
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd