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!
Not Recently Used Page Replacement Algorithm
The not recently used abbreviated as NRU page replacement algorithm works on the subsequent principle: while a page is referenced, a referenced bit is set for that page, marking it as referenced. Likewise, while a page is modified (written to), a modified bit is set. At a specific fixed time interval, the clock interrupt triggers and clears the referenced bit of all the pages, thus only pages referenced in the current clock interval are marked with a referenced bit. When a page requires to be replaced, the operating system categorizes the pages into four classes:
a) Class 0: not referenced, not modified b) Class 1: not referenced, modified c) Class 2: referenced, not modified d) Class 3: referenced, modified.
The NRU (Not recently used) algorithm picks a random page from the lowest category for removal.
Can you give an example of when it would be appropriate to use a web service as opposed to a non-serviced .NET component? A web service has the following characteristics: 1
Which scheduler selects processes from secondary storage device? Ans. Medium term scheduler selects processes from secondary storage device.
prepare FTR
Explain new services of CPU Based Exchange. These new services are termed as supplementary services and several of the prominent ones are given below as: Category 1:
How are the applications of generic framework for electronic commerce performed? To perform applications, this is essential to have Supporting Information and Organizational In
Q. Explain Fixed Point Representation? The fixed-point numbers in binary has a sign bit. A positive number has a sign bit 0 whereas negative number has a sign bit 1. In fixed-p
how it is calculated?
It is fast because it has got separate program and data memory(highly pipelined architecture)
Th e ID3 algorithm The calculation for information gain is the very difficult phase of this algorithm. ID3 performs a search whereby the search states are decision trees an
Sort the following list using selection sort technique, displaying each step. 20,12,25,6,10,15,13
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