Last week, Nate and I counted all the inventory. answer :A
Answer:
B. False
Explanation:
A page-replacement policy can be defined as a set of algorithm that instructs the operating systems on what memory page is to be swapped, paged out or written to disk in order to allocate more memory as they're required by various active processes during virtual memory management.
Some of the algorithms or techniques used by the operating system for page-replacement policy are;
1. Last In First Out (LIFO).
2. First In First Out (FIFO).
3. Least Recently Used (LRU).
4. Least Frequently Used (LFU).
5. Optimal (OPT or MIN).
Hence, the page-replacement policy means that pages are placed to make more space and to minimize the total number of page that would be missing.
Well knowing how the government is with security id go with A. as it makes a lot of sense unlike B and D and if they were looking for software the question would mention it
Answer:
The answer to this question is given below in the explanation section.
Explanation:
The answer is the seek time.
The seek time is the time for the disk arm to move the heads to the cylinder containing the desired sector.
