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!
Additional-reference-bits algorithm
We can keep an 8-bit byte for every page in a table in memory. The operating system shifts the reference bits right 1 bit, discarding the low-order bit. These 8 bits sift register have the history of page used for previous eight time periods. A page with a history value of 11000100 has been used more just than has one with 01110111. The page with the lowest number is the LRU page, and it can be changed.
what if we need the portion from a text based on some keyword. For eg. My file is like below, ------------------------------------------------ Order=[ 1 2 3 4 5 Order=[ 6 7 8 9
why we say" OS is a resource allocator" and “OS is a control program"?
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
Q. Is there any way to execute truly stable storage? Describe your answer. Answer: Truly steady storage would never lose data. The fundamental technique for steady storage is
What are the multithreading models? There are three models:- a) Many-to-One model b) One-to-One model c) Many-to-Many model
Write a short note on disk structure Modern disk drives are initiate as large one dimensional array of logical blocks where the logical block is the smallest unit of transfer.
Hierarchical paging method Most modern computer systems maintain a large logical-address space. In this situation the page table itself turns into excessively large. To remedy
In a multiprogramming and time-sharing environment, several users share the system simultaneously. This situation can result in various security problems. a
COMPARISON OF DISK SCHEDULING ALGORITHMS Name Description Remarks (Selection according to requestor) RSS Random scheduling fo
Difference between threads and processes 1. Thread is flow of implementation. Process is group of instruction which is alike to that of a program except which may be stopped an
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