Given memory partitions of 100 kb,500 kb,200 kb,300 kb, and 600 kb(in order), how would each of the first-fit, best-fit, and worst-fit algorithms place processes of 212 kb, 417 kb, 112 kb, and 426 kb, (in order)? which algorithm makes the most efficientuse of memory?

First-fit, Best-fit, and Worst-fit these are the techniques for the memory allocation of process in the memory locations.

First -fit: Allocating the first memory location to the process which is just smaller than or equal.

Best-fit: Allocating the smallest memory location that is greater than or equal to the size of process.  

Worst-fit: Allocating the largest memory location in the storage to the processes.

These are the memory locations-100 kb,500 kb,200 kb,300 kb,600 kb                        and size of processes-212 kb,417 kb,112 kb and 426 kb

For the first-fit,

We allocate 212 kb to the 500 kb memory location

Then, we allocate 417 kb to the 600 kb because others don't have the size.

Then,we allocate 112 kb to the 200kb

426 kb will stop,as no memory locations can execute.

For the Best-fit,

We allocate 212 kb to the 300 kb memory location

Then,we allocate 417 kb to the 500 kb.

Then,we allocate 112 kb to the 200 kb not 600 kb according to best-fit.

Then we allocate 426 kb to the 600 kb.

For the worst fit,

We allocate 212 kb to the 600 kb memory location according to the worst-fit algorithm.

Then,we allocate 417 kb to the 500 kb.

Then,we allocate 112 kb to the 300 kb

We can' allocate 426 kb in any memory location.

Best-fit algorithm makes the most efficient use of memory,as it only able to serve each processes.  

since it can be assumed that what aslam is making is a template by compiling all the commonly used excel formatting in several worksheets in an excel document, aslam can choose to save it using the .xltx or .xltm format instead. thus, aslam can distribute the templates he has made to his team members in an easier manner.