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.
Answer:
2
Explanation:
The output of the Java program is 2. The public Vehicle class is defined with the class variable 'counter'. When a Vehicle class object is instantiated, the counter variable increments by one.
In the program, the two instances of the class are created, incrementing the counter variable to two, the print statement outputs 2 as the result of the program.
Answer:
Problem Statement
Explanation:
The problem statement is described the complete description of the task of the program. It gives a clear description of the program.
The main objective to develop a problem statement explain the program in a detailed manner The good programmer firstly create the problem statement of the program then it created the program by following the guidelines of the problem statement.
