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 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 p
We are use to using variables within C without thinking about where they are stored. Most variables are dynamic i.e. can change, therefore they are stored in Ram, unlike a program
Q. Under what conditions do page faults occur? Explain the actions taken by the operating system when a page fault occurs. Answer: A page fault take places when an access to
Write a short note on Memory management. Memory management includes reallocating and allocating the memory space. The kinds of allocation of memory FIXED PARTITIONING
Q. Explain the booting process for a Windows XP system? Answer: (1) Since the hardware powers on the BIOS begins executing From ROMand loads as well as executes the bootstrap
What are the five major activities of an operating system in regard to file management? The creation and deletion of files The creation and deletion of directories The s
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
what is the use of valid invalid bits in paging
SCAN o Go from the outside to the inside servicing requests and after that back from the outside to the inside servicing requests. o Replicate this over and over. o Diminish
how to solve queing theory step by step
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