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!
How can the deadlock be prevented-Safe State
Safe state: A state is safe if the system is able to allocate resources to each process in some order and still avoid deadlock. Further properly a system is in safe state only if there exists a safe sequence. Safe sequence is the ways that the sequence of process in the waiting queues getting the requested resources. If it does not get the requested resources then it will have to wait. A safe state isn't deadlocked state. On the contrary a deadlock state is an unsafe state. Not all unsafe states are considered as deadlock though an unsafe state may lead to a deadlock. As long as the state is safe the operating system can avoid unsafe states. In an unsafe state, the Operating System can't prevent processes from requesting resources such that a deadlock occurs.
what is difference between file descriptor and file pointer?
Consider a large web-based database. In some sense, Google is sort of like this. There might be many users who want to read from the database, but only a few users who are allowed
Explain with an example the need of Shift Alteration in critical section problem? Consider processes P i and P j and consider the algorithm for P i and P j .
Write a short note about the different STATES of a process. As a process implement it changes state. The state of a process is described in part by the current activity of that
FIXED PARTITIONING In a fixed partitioning, the operating system inhabiting some fixed portion of main memory is available for use of multiple processes -Using fixed partit
What are files and explain the access methods for files? File definition Attributes, operations and types Direct access Sequential access with diagram Other access
What is busy waiting? The repeated implementation of a loop of code while waiting for an event to happen is known as busy-waiting. The CPU is not engaged in any actual producti
. A paper mill produces two grades of paper viz., X and Y. Because of raw material restrictions, it cannot produce more than 400 tons of grade X paper and 300 tons of grade Y paper
What is low-level formatting? Before a disk can kept data, it must be required into sectors that the disk controller can read and write. This procedure is called low-level form
How Memory utilization factor shall be computed Memory utilization factor shall be defined as Memory in use/total memory connected
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