The dynamic allocation problem is how to satisfy a request of size n from a list of free holes in memory. The best-fit, first-fit and worst-fit strategies are most common techniques employed for selecting a free memory hole from set of memory holes.
problem 1: In brief illustrate out the above three (3) strategies.
problem 2: Given memory partitions of 100K, 500K, 200K, 300K and 600K (in order). How would each of First-fit, Best-fit and Worst-fit algorithms place processes of 212K, 417K, 112K and 426K (in order).
problem 3: Which algorithm makes the most capable use of memory?