Answer:
The memory allocation algorithm that is used to place the processes given is the <u>First Fit Algorithm </u>
Explanation:
The First Fit Management Algorithm works by ensuring that the pointer keeps track of all the free spaces in the memory and accepts and executes all instructions to allocate a memory block to the coming process as long as it is big enough to hold the size of the process.
For example, the First Fit algorithm will allocate the processes in the first block that fits (that is, if it can fit the memory bock in the queue, then the process will be store)
It will work as follows (recall that the memory partitions are in order and must remain so):
A) 115 KB is stored in 300KB block, leaving the following free spaces (185KB, 600KB, 350KB, 200KB, 750KB, 125KB), next
B) 500 KB is store in a 600KB block leaving the following free spaces (185 KB, 100 KB, 350 KB, 200 KB, 750 KB, 125 KB), next
C) 358 KB is stored in 750KB block, leaving the following free spaces (185KB, 100KB, 350KB, 200KB, 392KB, 125KB) next
D) 200 KB is stored in 350KB block, leaving the following free spaces (185 KB, 100
KB, 150KB, 200KB, 392KB, 125KB) next
E) 375KB is stored in 392KB block leaving (185KB, 100KB, 150KB, 200KB, 17KB, 125KB)
One of the demerits of this Algorithm is that, as shown above, memory is not maximized. It however is one of the easiest algorithms amongst all the other memory allocation processes.
Cheers
