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!
Here are the conditions necessary for a deadlock to occur; note that all of them are necessary, and none is suf?cient:
1. ?nite resources: the resources are held in a mutually-exclusive way, and they can be exhausted, causing waiting.
2. hold-and-wait: each thread holds one resource while waiting for another.
3. no preemption: threads only release resources voluntarily. No other thread (or the OS) can force the thread to release its resources.
4. circular wait: we have a circular chain of waiting threads.
Process Synchronization in windows 2000
We have stressed the need for an operating system to make efficient use of the computing hardware. When is it appropriate for the operating system to forsake this principle and to
Q. Is there any way to execute truly stable storage? Describe your answer. Answer: Truly steady storage would never lose data. The fundamental technique for steady storage is
Explain Belady's Anomaly? Also called FIFO anomaly. Usually, on enhancing the number of frames allocated to a process virtual memory, the process implementation is faster, beca
why we say " OS is a resource allocator" and “OS is a control program"?
Q. What are three benefits of dynamic (shared) linkage of libraries compared to static linkage? What are two situations where static linkage is preferable? Answer: The
Define request edge and assignment edge. Answer: A directed edge from process Pi to resource type R j is denoted by Pi->j; it signifies that process Pi requested an instance
List the various file attributes. A file has particular other attributes, which vary from one operating system to another, but typically having of these: Name, identifier, typ
In which page replacement policy Balady’s anomaly occurs? FIFO (First in First Out)
Enhanced Second chance algorithm In this a modify bit is as well used. Now if the ordered pair of reference and modify is (0,0) neither recently used nor modified - the best
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