contestada

Consider six memory partitions of 128 KB, 512 KB, 192 KB, 256 KB, 512 KB, and 448 KB (in order). How would each of the first-fit and best-fit algorithms place processes of 210 KB, 420 KB, 110 KB, 450 KB, and 76 KB (in order)

Respuesta :

Answer:

Following are the solution to the given question:

Explanation:

Please find the image file in the attachment.

The first fit (FF) System for both the allocation for capital for the first attach appends information to just the memory through scanning the very first space, that's at least wide enough to accommodate the data, from the start. So space is allocated to information.

  • Its best solution is to allocate the least stable division which meets the challenging performance effects.
  • It assessment searches throughout the whole list of free partition for the very first time, taking into account the smallest appropriate hole. It tries to find another whole near the process required size.
Ver imagen codiepienagoya

Otras preguntas