contestada

Suppose we have the following page accesses: 1 2 3 4 2 3 4 1 2 1 1 3 1 4 and that there are three frames within our system. Using the FIFO replacement algorithm, what will be the final configuration of the three frames following the execution of the given reference string?A) 4, 1, 3B) 3, 1, 4C) 4, 2, 3D) 3, 4, 2

Respuesta :

Answer:

D.  3, 4, 2

Explanation:

Definition

The algorithm in which the element that will come first will process first. This algorithm is used in computers for management of processes. With the help of this algorithm, the task that need to be performed are arranged in the queue to get processed.

Otras preguntas