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.
Write a short note on PCB? Every process is represented in the operating system by a process control block also called a task control block. It contains more information regard
Enhanced second-chance algorithm. When we increase the second-chance algorithm by considering both the reference bit and the modify bit as an order pair. We have the following
Q. Why would it be an awful idea for gateways to pass broadcast packets between networks? What would be the merite of doing so? Answer: All broadcasts would be spreads to all
Now, let us discuss two related algorithms for deciding which pages to evict. The clock algorithm is one of the most popular choices. It works by keeping frames in a circular struc
i need the job to be done within 3 days
What are overlays? To enable a process to be larger than the amount of memory allocated to it, overlays are used. The idea of overlays is to keep in memory only those instructi
The idea of reference counting is to maintain, for every object, the total number of references to that object, i.e. the number of "incoming" pointers. Whenever the number of refer
Explain Deadlock Prevention-Resource allocation graph allocation Resource allocation graph algorithm : Using this algorithm we are able to actually know if there exists in th
Explain the Request or Response interface The Request/Response interface is ideal for a message based client-server interaction. By modeling components to interact via a reque
draw a state diagram showing the transissions of a process from creation to termination
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