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!
What is meant by demand paging? Explain.
Demand paging is a technique to implement virtual memory. In demand paging simply when a page is required it is brought into memory. As an alternative of swapping the whole process into memory only the required pages are brought into the memory. Therefore it will not read pages which are not used and hence results in reduced swap time and memory needed.
For distinguishing the pages in memory and those on disk a valid invalid bit is used. If the bit is valid the page is in memory moreover the page is either not in memory or is not valid. The page table entry for a page that isn't currently in the memory is marked invalid.
Explain segmentation hardware? We define an completion to map two-dimensional user-defined addresses into one-dimensional physical addresses. This mapping is affected by means
Virtual File System serves two important functions. 1. It divides file-system-generic operations from their execution by defining a clean VFS interface. 2. The VFS is based
Define caching. A cache is a region of fast memory that holds copies of data. Access to the cached copy is well-organized than access to the original. Caching and buffering are
linked allocation using i node
Q. When a process creates a fresh process using the fork() operation which of the following state is shared among the parent process and the child process? 1 Stack 2 Heap
Q. Suppose that you want to utilize a paging algorithm that requires a reference bit (such as second-chance replacement or working-set model) however the hardware does not provide
When the Page fault frequency in an operating system is reduced Locality of reference is appropriate to the process
Q. Presume that a distributed system is susceptible to server failure. What mechanisms would be needed to guarantee the exactly once semantics for execution of RPCs? Ans
draw a state diagram showing the transissions of a process from creation to termination
explain dynamic patrician stratagies
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