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!
Explain FIFO page replacement
A FIFO replacement algorithm associates with every page the time when that page was brought into memory. When a page must be changed, the oldest page is chosen. We can make a FIFO queue to hold all pages in memory. We change the page at the head of the queue. Insert page at the last of the queue.
Explain the Peterson's solution for the critical section problem? In Peterson's solution two variables a) flag and b) turn are used as shared variables. If the both shared vari
i need the job to be done within 3days
Now we consider the following questions: how can the parent process communicate with its child? Or how can children processes communicate with other children? The exact answer depe
LIST OUT THE NETWORK OPERATING OS
8(5-3)-20=
The swapper work s on the biggest scheduling priority. Initially it will look for any sleeping process, if not get then it will see for the ready-to-run process for swapping. Bu
Q. Why High level languages need Compiler? High level languages - illustrations are COBOL, FORTRAN, PL/I andALGOL - are processed by interpreters andcompilers. A compilers is a
What is a general graph? A tree structure where links can go from one branch to a node earlier in the similar branch or other branch, allowing cycles.
Banker's Algorithm In this analogy Customers ≡ processes Units ≡ resources, say, tape drive Ba
How does user specify block to be fetched in direct access? By specifying the relative block number, relative to first block in file, which is block 0.
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