Answer:
C. FIFO
Explanation:
The first-in, first-out (FIFO) page replacement algorithm is a low-overhead algorithm that requires work on the part of the operating system. On a page fault, the frame that has been in memory the longest is replaced.
Using FIFO algorithm implies that
a page which was brought into memory first will be removed first since variable was initialized very early. it is in the set of first in pages that will be removed.
It is the simplest page replacement algorithm. The operating system keeps track of all pages in the memory in a queue, the oldest page is in the front of the queue. When a page needs to be replaced page in the front of the queue is selected for removal that is first in first out.
A memory page containing a heavily used variable that was initialized very early and is in constant use is removed, then the page replacement algorithm used is called First In First Out.
Answer:Valor singular de descomposición
Explanation:
Answer:
it means someone thought your response to something was helpful. :))
Explanation:
Answer:
- Absence of control statements
Explanation:
In the research of software development in 1970 it is found that there are two deficiencies.
1 Absence of type checking
The researcher sees that there is a fault in the type checker we can not convert one datatype into the other data type also it gives error in converting the one datatype into another.
2 Absence of control statements
The control statement plays an important role in the programming language . When the condition of the multiple arises then in that condition we used the control statement .in 1970 their is deficiencies of control statement.
Hence type checking and control statements are the two programming language deficiencies which are found by the researcher in software development of 1970.